3-Choosability of Triangle-Free Planar Graphs with Constraints on 4-Cycles (original) (raw)
Related papers
Note on 3-choosability of planar graphs with maximum degree 4
Discrete Mathematics
Planar graphs without triangles adjacent to cycles of length from 4 to 7 are 3-colorable
Discrete Mathematics, 2010
(3, 1)*-CHOOSABILITY of Planar Graphs Without Adjacent Short Cycles
Electronic Notes in Discrete Mathematics, 2013
A note on the acyclic 3-choosability of some planar graphs
Discrete Applied Mathematics, 2010
On the 3-colorability of planar graphs without 4-, 7- and 9-cycles
Discrete Mathematics, 2009
Planar graphs without 5- and 7-cycles and without adjacent triangles are 3-colorable
Journal of Combinatorial Theory, Series B, 2009
Planar graphs without adjacent cycles of length at most seven are 3-colorable
Discrete Mathematics, 2010
A sufficient condition for planar graphs to be 3-colorable
Journal of Combinatorial Theory, 2003
On -choosability of planar graphs without adjacent short cycles
Discrete Applied Mathematics, 2014
Planar graphs without cycles of length from 4 to 7 are 3-colorable
Journal of Combinatorial Theory, 2005
Every planar graph without cycles of lengths 4 to 12 is acyclically 3-choosable
Information Processing Letters, 2009
Some structural properties of planar graphs and their applications to 3-choosability
Discrete Mathematics, 2012
On acyclic 4-choosability of planar graphs without short cycles
Discrete Mathematics, 2010
Multiple list colouring triangle-free planar graphs
arXiv (Cornell University), 2018
Acyclic 4-choosability of planar graphs with neither 4-cycles nor triangular 6-cycles
Discrete Mathematics, 2010
Choosability of planar graphs of girth 5
2011
Choosability with separation of planar graphs without prescribed cycles
Applied Mathematics and Computation, 2020
On the Three Colorability of Planar Graphs
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 4-choosability of planar graphs without adjacent short cycles
Discrete Mathematics, 2012
Acyclic 4-colorability of planar graphs without cycles of length 4 or 6
Journal of Applied and Industrial Mathematics, 2010
Acyclic choosability of planar graphs: a Steinberg like approach
Electronic Notes in Discrete Mathematics, 2009
Acyclic 5-choosability of planar graphs without 4-cycles
Discrete Mathematics, 2008
Three-coloring triangle-free planar graphs in linear time
ACM Transactions on Algorithms, 2011
Acyclic 5-choosability of planar graphs without small cycles
Journal of Graph Theory, 2007
Bordeaux 3-color conjecture and 3-choosability
Discrete Mathematics, 2006
Planar graphs with girth at least 5 are (3,5)-colorable
Discrete Mathematics, 2015
Structural properties and edge choosability of planar graphs without 4-cycles
Discrete Mathematics, 2008
Path Choosability of Planar Graphs
The Electronic Journal of Combinatorics, 2018
A Class of Three-Colorable Triangle-Free Graphs
Journal of Graph Theory, 2012
Thresholds for Path Colorings of Planar Graphs
Algorithms and Combinatorics