Planar graphs without cycles of length from 4 to 7 are 3-colorable (original) (raw)
Related papers
On the 3-colorability of planar graphs without 4-, 7- and 9-cycles
Discrete Mathematics, 2009
Planar graphs without adjacent cycles of length at most seven are 3-colorable
Discrete Mathematics, 2010
Planar graphs without 5- and 7-cycles and without adjacent triangles are 3-colorable
Journal of Combinatorial Theory, Series B, 2009
A sufficient condition for planar graphs to be 3-colorable
Journal of Combinatorial Theory, 2003
Planar graphs without triangles adjacent to cycles of length from 4 to 7 are 3-colorable
Discrete Mathematics, 2010
On the Three Colorability of Planar Graphs
Acyclic 4-colorability of planar graphs without cycles of length 4 or 6
Journal of Applied and Industrial Mathematics, 2010
The proof of Steinberg's three coloring conjecture
Planar graphs with girth at least 5 are (3,5)-colorable
Discrete Mathematics, 2015
DP-4-colorability of two classes of planar graphs
Discrete Mathematics, 2019
Complete colorings of planar graphs
Discrete Applied Mathematics, 2019
Plane Graphs with Maximum Degree 6 are Edge-face 8-colorable
Graphs and Combinatorics, 2013
Note on 3-choosability of planar graphs with maximum degree 4
Discrete Mathematics
Planar graphs with maximum degree 4 are strongly 19-edge-colorable
Discrete Mathematics, 2018
On the complexity of -colouring planar graphs
Discrete Mathematics, 2009
On total chromatic number of planar graphs without 4-cycles
Science in China Series A: Mathematics, 2007
The Two-Coloring Number and Degenerate Colorings of Planar Graphs
Siam Journal on Discrete Mathematics, 2009
Coloring Vertices and Faces of Locally Planar Graphs
Graphs and Combinatorics, 2006
On vertex types and cyclic colourings of 3-connected plane graphs
Discrete Mathematics, 2000
Acyclic edge coloring of planar graphs with colors
Discrete Applied Mathematics, 2012
3-Choosability of Triangle-Free Planar Graphs with Constraints on 4-Cycles
SIAM Journal on Discrete Mathematics, 2010
Polychromatic Colorings of Plane Graphs
Discrete & Computational Geometry, 2009
On uniquely colorable planar graphs
Journal of Combinatorial Theory, 1969
Strong edge-coloring of planar graphs
Discrete Mathematics, 2014
Steinberg's Conjecture and near-colorings
Colorability of Planar Graphs with Isolated Nontriangular Faces
2004
Bordeaux 3-color conjecture and 3-choosability
Discrete Mathematics, 2006
Additive colorings of planar graphs
arXiv preprint arXiv: …, 2012
Acyclic list 7-coloring of planar graphs
Journal of Graph Theory, 2002
A note on the acyclic 3-choosability of some planar graphs
Discrete Applied Mathematics, 2010
3-FACIAL Colouring of Plane Graphs
Computing Research Repository - CORR, 2006
Good and Semi-Strong Colorings of Oriented Planar Graphs
Information Processing Letters, 1994
Planar Digraphs of Digirth Four are 2-Colorable
SIAM Journal on Discrete Mathematics, 2017