scientific article
From MaRDI portal
Publication:3139765
zbMath0791.05044MaRDI QIDQ3139765
Publication date: 8 June 1994
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
algorithmchromatic numbercubic graphsplanar graphouterplanar graphnowhere-zero 3-flowsthree color problem3-colorable planar graphs
Analysis of algorithms and problem complexity (68Q25) Random graphs (graph-theoretic aspects) (05C80) Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38) Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)
Related Items (max. 100)
Every planar graph without 4-cycles and 5-cycles is (3,3)-colorable ⋮ Every planar graph without cycles of length 4 or 9 is \((1, 1, 0)\)-colorable ⋮ A Steinberg-like approach to describing faces in 3-polytopes ⋮ Further extensions of the Grötzsch theorem ⋮ A new 4-chromatic edge critical Koester graph ⋮ Three-coloring triangle-free graphs on surfaces. I: Extending a coloring to a disk with one triangle. ⋮ Circular backbone colorings: on matching and tree backbones of planar graphs ⋮ The Strong Fractional Choice Number and the Strong Fractional Paint Number of Graphs ⋮ Three-coloring planar graphs without short cycles ⋮ On 3-colorable planar graphs without cycles of four lengths ⋮ A new proof of Grünbaum's 3 color theorem ⋮ 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 ⋮ Characterization of Cycle Obstruction Sets for Improper Coloring Planar Graphs ⋮ Choosability with union separation of planar graphs without cycles of length 4 ⋮ Facially-constrained colorings of plane graphs: a survey ⋮ Every planar graph without triangles adjacent to cycles of length 3 or 6 is \(( 1 , 1 , 1 )\)-colorable ⋮ Irreducible graphs in the Grünbaum-Havel 3-colour problem ⋮ Planar graphs without \(\{4, 6, 8\}\)-cycles are 3-choosable ⋮ 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 ⋮ Unnamed Item ⋮ 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)$ ⋮ Planar graphs without 3-cycles adjacent to cycles of length 3 or 5 are \((3, 1)\)-colorable ⋮ 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 ⋮ The \((3, 3)\)-colorability of planar graphs without 4-cycles and 5-cycles ⋮ A sufficient condition for planar graphs to be 3-colorable ⋮ Group connectivity and group colorings of graphs --- a survey ⋮ Improper colorability of planar graphs without prescribed short cycles ⋮ Unnamed Item ⋮ Short proofs of coloring theorems on planar graphs ⋮ Planar graphs with cycles of length neither 4 nor 6 are \((2,0,0)\)-colorable ⋮ Decomposing a planar graph without cycles of length 5 into a matching and a 3-colorable graph ⋮ Steinberg-like theorems for backbone colouring ⋮ Nowhere-zero 3-flows and modulo \(k\)-orientations ⋮ 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 ⋮ Planar graphs with cycles of length neither 4 nor 7 are \((3,0,0)\)-colorable ⋮ On 3-choosability of plane graphs without 6-, 7- and 9-cycles ⋮ Concepts of signed graph coloring ⋮ 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 ⋮ Parity-constrained triangulations with Steiner points ⋮ Every planar graph with cycles of length neither 4 nor 5 is \((1,1,0)\)-colorable ⋮ On 3-colorable planar graphs without prescribed cycles ⋮ Distance constraints on short cycles for 3-colorability of planar graphs ⋮ Polychromatic colorings of plane 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 ⋮ Steinberg-like theorems for backbone colouring ⋮ An introduction to the discharging method via graph coloring ⋮ Flexibility of planar graphs -- sharpening the tools to get lists of size four ⋮ 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 ⋮ Counterexamples to Grötzsch-Sachs-Koester's conjecture ⋮ Planar graphs without cycles of length from 4 to 7 are 3-colorable ⋮ 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 ⋮ A smaller planar graph without 4-, 5-cycles and intersecting triangles that is not 3-choosable ⋮ On 3-colorability of planar graphs without adjacent short cycles ⋮ 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 ⋮ Decomposing a planar graph without triangular 4-cycles into a matching and a 3-colorable graph ⋮ On dispersable book embeddings ⋮ Planar graphs without 4-cycles and close triangles are \((2,0,0)\)-colorable ⋮ Infinite families of 4-chromatic Grötzsch-Sachs graphs ⋮ Every planar graph without 5-cycles and \(K_4^-\) and adjacent 4-cycles is \((2, 0, 0)\)-colorable ⋮ A Brooks-type result for sparse critical graphs ⋮ On 3-colorable planar graphs without short cycles ⋮ An upper bound on adaptable choosability of graphs ⋮ Planar graphs without adjacent cycles of length at most five are \((1,1,0)\)-colorable ⋮ Planar 4-critical graphs with four triangles ⋮ A note on the three color problem ⋮ 4-chromatic edge critical Grötzsch-Sachs graphs ⋮ Planar graphs without 5- and 7-cycles and without adjacent triangles are 3-colorable ⋮ A structural theorem on embedded graphs and its application to colorings ⋮ Nowhere-zero 3-flows in toroidal graphs ⋮ Adapted list coloring of planar graphs ⋮ \((1,0,0)\)-colorability of planar graphs without cycles of length \(4\) or \(6\) ⋮ A relaxation of Novosibirsk 3-color conjecture ⋮ 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 ⋮ On the 3-colorability of planar graphs without 4-, 7- and 9-cycles ⋮ Planar graphs without adjacent cycles of length at most seven are 3-colorable ⋮ A note on 3-choosability of planar graphs without certain cycles ⋮ Some of My Favorite Coloring Problems for Graphs and Digraphs ⋮ On structure of some plane graphs with application to choosability ⋮ The 4-choosability of plane graphs without 4-cycles ⋮ A relaxation of the Bordeaux conjecture ⋮ Partitioning planar graphs without 4-cycles and 6-cycles into a linear forest and a forest
This page was built for publication:
