Planar graphs without cycles of length from 4 to 7 are 3-colorable
From MaRDI portal
Publication:1767673
DOI10.1016/j.jctb.2004.11.001zbMath1056.05052OpenAlexW2033177498MaRDI QIDQ1767673
Alekseĭ Nikolaevich Glebov, Mohammad R. Salavatipour, Oleg V. Borodin, Andre Raspaud
Publication date: 8 March 2005
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jctb.2004.11.001
Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)
Related Items (max. 100)
A Steinberg-like approach to describing faces in 3-polytopes ⋮ Building a maximal independent set for the vertex-coloring problem on planar graphs ⋮ A note on the not 3-choosability of some families of planar graphs ⋮ Three-coloring planar graphs without short cycles ⋮ On 3-colorable planar graphs without cycles of four lengths ⋮ A note on 3-choosability of planar graphs ⋮ 3-Paintability of planar graphs ⋮ A 3-color theorem on plane graphs without 5-circuits ⋮ On 3-colorable plane graphs without 5- and 7-cycles ⋮ Steinberg's conjecture is false ⋮ Facially-constrained colorings of plane graphs: a survey ⋮ Planar graphs without \(\{4, 6, 8\}\)-cycles are 3-choosable ⋮ A Note on the Minimum H-Subgraph Edge Deletion ⋮ Planar graphs without cycles of length 4 or 5 are (3,0,0)-colorable ⋮ (\(1,1,0\))-coloring of planar graphs without cycles of length 4 and 6 ⋮ A step towards the strong version of Havel's three color conjecture ⋮ Planar graphs without 4- and 6-cycles are (7 : 2)-colorable ⋮ New restrictions on defective coloring with applications to Steinberg-type graphs ⋮ Every signed planar graph without cycles of length from 4 to 8 is 3-colorable ⋮ Circular coloring and fractional coloring in planar graphs ⋮ Plane Graphs without 4- and 5-Cycles and without Ext-Triangular 7-Cycles are 3-Colorable ⋮ Mapping sparse signed graphs to (K2k,M) $({K}_{2k},M)$ ⋮ Every planar graph without 4-cycles and 5-cycles is (3,3)-colorable ⋮ Fractional coloring planar graphs under Steinberg-type conditions ⋮ Planar graphs without cycles of length 4 or 5 are \((2, 0, 0)\)-colorable ⋮ Planar graphs without 5-cycles and intersecting triangles are \((1, 1, 0)\)-colorable ⋮ Unnamed Item ⋮ Short proofs of coloring theorems on planar graphs ⋮ Fast 3-coloring triangle-free planar graphs ⋮ Decomposing a planar graph without cycles of length 5 into a matching and a 3-colorable graph ⋮ Unnamed Item ⋮ Partitioning planar graphs without 4-cycles and 5-cycles into bounded degree forests ⋮ (Circular) backbone colouring: forest backbones in planar graphs ⋮ \((1,0,0)\)-colorability of planar graphs without cycles of length 4, 5 or 9 ⋮ Some structural properties of planar graphs and their applications to 3-choosability ⋮ A sufficient condition on 3-colorable plane graphs without 5- and 6-circuits ⋮ Plane graphs without cycles of length 4, 6, 7 or 8 are 3-colorable ⋮ On 3-colorable planar graphs without prescribed cycles ⋮ Distance constraints on short cycles for 3-colorability of planar graphs ⋮ \((1,0,0)\)-colorability of planar graphs without prescribed short cycles ⋮ The 3-colorability of planar graphs without cycles of length 4, 6 and 9 ⋮ An introduction to the discharging method via graph coloring ⋮ List coloring of planar graphs with forbidden cycles ⋮ Correspondence coloring and its application to list-coloring planar graphs without cycles of lengths 4 to 8 ⋮ Planar graphs without 4, 6, 8-cycles are 3-colorable ⋮ Acyclic 4‐Choosability of Planar Graphs with No 4‐ and 5‐Cycles ⋮ A Complexity Dichotomy for the Coloring of Sparse Graphs ⋮ Unnamed Item ⋮ On 3-colorings of plane graphs ⋮ Every planar graph without 3-cycles adjacent to 4-cycles and without 6-cycles is (1, 1, 0)-colorable ⋮ On 3-colorability of planar graphs without adjacent short cycles ⋮ A note on the acyclic 3-choosability of some planar graphs ⋮ Planar graphs without triangles adjacent to cycles of length from 4 to 7 are 3-colorable ⋮ Acyclic 4-choosability of planar graphs with neither 4-cycles nor triangular 6-cycles ⋮ Planar graphs without adjacent cycles of length at most five are (2, 0, 0)-colorable ⋮ Planar graphs without 4-cycles and close triangles are \((2,0,0)\)-colorable ⋮ Every planar graph without cycles of lengths 4 to 12 is acyclically 3-choosable ⋮ Every planar graph without 5-cycles and \(K_4^-\) and adjacent 4-cycles is \((2, 0, 0)\)-colorable ⋮ Complexity and algorithms for injective edge-coloring in graphs ⋮ A refinement of choosability of graphs ⋮ On 3-colorable planar graphs without short cycles ⋮ Planar graphs with neither 5-cycles nor close 3-cycles are 3-colorable ⋮ Planar graphs without adjacent cycles of length at most five are \((1,1,0)\)-colorable ⋮ Planar graphs without 5- and 7-cycles and without adjacent triangles are 3-colorable ⋮ A NOTE ON 3-COLORABLE PLANE GRAPHS WITHOUT 5- AND 7-CYCLES ⋮ A structural theorem on embedded graphs and its application to colorings ⋮ Planar graphs without cycles of lengths 4 and 5 and close triangles are DP-3-colorable ⋮ \((1,0,0)\)-colorability of planar graphs without cycles of length \(4\) or \(6\) ⋮ Every planar graph without adjacent cycles of length at most 8 is 3-choosable ⋮ Note on 3-choosability of planar graphs with maximum degree 4 ⋮ Planar graphs without short even cycles are near-bipartite ⋮ On the 3-colorability of planar graphs without 4-, 7- and 9-cycles ⋮ Planar graphs without cycles of length 4, 5, 8, or 9 are 3-choosable ⋮ Planar graphs without adjacent cycles of length at most seven are 3-colorable ⋮ A note on 3-choosability of planar graphs without certain cycles ⋮ Acyclic choosability of planar graphs: a Steinberg like approach ⋮ A note on the three color problem on planar graphs without 4- and 5-cycles and without ext-triangular 7-cycles ⋮ A relaxation of the Bordeaux conjecture
Cites Work
This page was built for publication: Planar graphs without cycles of length from 4 to 7 are 3-colorable
