Some structural properties of planar graphs and their applications to 3-choosability (original) (raw)
Related papers
(3, 1)*-CHOOSABILITY of Planar Graphs Without Adjacent Short Cycles
Electronic Notes in Discrete Mathematics, 2013
3-Choosability of Triangle-Free Planar Graphs with Constraints on 4-Cycles
SIAM Journal on Discrete Mathematics, 2010
On -choosability of planar graphs without adjacent short cycles
Discrete Applied Mathematics, 2014
A note on the acyclic 3-choosability of some planar graphs
Discrete Applied Mathematics, 2010
Note on 3-choosability of planar graphs with maximum degree 4
Discrete Mathematics
Structural properties and edge choosability of planar graphs without 4-cycles
Discrete Mathematics, 2008
Every planar graph without cycles of lengths 4 to 12 is acyclically 3-choosable
Information Processing Letters, 2009
Acyclic 4-choosability of planar graphs with neither 4-cycles nor triangular 6-cycles
Discrete Mathematics, 2010
Choosability with separation of planar graphs without prescribed cycles
Applied Mathematics and Computation, 2020
Acyclic 4-choosability of planar graphs without adjacent short cycles
Discrete Mathematics, 2012
On acyclic 4-choosability of planar graphs without short cycles
Discrete Mathematics, 2010
Acyclic 4-choosability of planar graphs
Discrete Mathematics, 2011
A sufficient condition for planar graphs to be acyclically 5-choosable
Journal of Graph Theory, 2012
Acyclic choosability of planar graphs: a Steinberg like approach
Electronic Notes in Discrete Mathematics, 2009
The 3-choosability of plane graphs of girth 4
Discrete Mathematics, 2005
Acyclic 5-Choosability of Planar Graphs Without Adjacent Short Cycles
2013
On the total choosability of planar graphs and of sparse graphs
Information Processing Letters, 2010
Choosability of planar graphs of girth 5
2011
Path Choosability of Planar Graphs
The Electronic Journal of Combinatorics, 2018
Acyclic 5-choosability of planar graphs without small cycles
Journal of Graph Theory, 2007
On the 3-colorability of planar graphs without 4-, 7- and 9-cycles
Discrete Mathematics, 2009
Acyclic 5-choosability of planar graphs without 4-cycles
Discrete Mathematics, 2008
Planar Graphs Without Cycles of Specific Lengths
European Journal of Combinatorics, 2002
Planar graphs without adjacent cycles of length at most seven are 3-colorable
Discrete Mathematics, 2010
Planar graphs without 4-cycles adjacent to 3-cycles are list vertex 2-arborable
Journal of Graph Theory, 2009
The edge-face choosability of plane graphs with maximum degree at least 9
A sufficient condition for planar graphs to be 3-colorable
Journal of Combinatorial Theory, 2003
Planar graphs without 5- and 7-cycles and without adjacent triangles are 3-colorable
Journal of Combinatorial Theory, Series B, 2009
On the planarity of cyclic graphs
Rocky Mountain Journal of Mathematics, 2018
Acyclic 3-choosability of sparse graphs with girth at least 7
Discrete Mathematics, 2010
Bordeaux 3-color conjecture and 3-choosability
Discrete Mathematics, 2006
Planar graphs without triangles adjacent to cycles of length from 4 to 7 are 3-colorable
Discrete Mathematics, 2010
Subgraphs with Restricted Degrees of Their Vertices in Planar 3-Connected Graphs
Graphs and Combinatorics, 1997
Planar graphs without cycles of length from 4 to 7 are 3-colorable
Journal of Combinatorial Theory, 2005