scientific article; zbMATH DE number 434910

zbMATH Open0791.05044MaRDI QIDQ3139765FDOQ3139765

Richard Steinberg

Publication date: 8 June 1994

Title of this publication is not available (Why is that?)

Recommendations

• Planar graphs without triangles adjacent to cycles of length from 3 to 9 are 3-colorable
• Three-coloring triangle-free planar graphs in linear time
• Three-coloring triangle-free planar graphs in linear time
• Many 3-colorings of triangle-free planar graphs
• A new proof of Grünbaum's 3 color theorem

zbMATH Keywords

algorithmchromatic numbercubic graphsouterplanar graphplanar graphnowhere-zero 3-flowsthree color problem3-colorable planar graphs

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15) Paths and cycles (05C38)

Cited In (only showing first 100 items - show all)

• 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
• Adapted list coloring of planar graphs
• The \((3, 3)\)-colorability of planar graphs without 4-cycles and 5-cycles
• Correspondence coloring and its application to list-coloring planar graphs without cycles of lengths 4 to 8
• A note on 3-choosability of planar graphs without certain cycles
• Infinite families of 4-chromatic Grötzsch-Sachs graphs
• Nowhere-zero 3-flows and modulo \(k\)-orientations
• The 4-choosability of plane graphs without 4-cycles
• A smaller planar graph without 4-, 5-cycles and intersecting triangles that is not 3-choosable
• Polychromatic colorings of plane graphs
• Plane Graphs without 4- and 5-Cycles and without Ext-Triangular 7-Cycles are 3-Colorable
• An upper bound on adaptable choosability of graphs
• Nowhere-zero 3-flows in toroidal graphs
• Planar graphs with cycles of length neither 4 nor 7 are \((3,0,0)\)-colorable
• Planar graphs without 4, 6, 8-cycles are 3-colorable
• The plurality problem with three colors and more.
• Three-coloring triangle-free graphs on surfaces. I: Extending a coloring to a disk with one triangle.
• Planar graphs without 4-cycles and close triangles are \((2,0,0)\)-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
• Title not available (Why is that?)
• Note on 3-choosability of planar graphs with maximum degree 4
• Irreducible graphs in the Grünbaum-Havel 3-colour problem
• On 3-colorable plane graphs without 5- and 7-cycles
• Facially-constrained colorings of plane graphs: a survey
• Planar graphs without adjacent cycles of length at most five are \((1,1,0)\)-colorable
• Planar 4-critical graphs with four triangles
• On structure of some plane graphs with application to choosability
• A Steinberg-like approach to describing faces in 3-polytopes
• Planar graphs without 5- and 7-cycles and without adjacent triangles are 3-colorable
• Decomposing a planar graph without cycles of length 5 into a matching and a 3-colorable graph
• Circular coloring and fractional coloring in planar graphs
• The 3-colorability of planar graphs without cycles of length 4, 6 and 9
• 4-chromatic edge critical Grötzsch-Sachs graphs
• Planar graphs without \(\{4, 6, 8\}\)-cycles are 3-choosable
• A sufficient condition on 3-colorable plane graphs without 5- and 6-circuits
• Three-coloring planar graphs without short cycles
• Counterexamples to Grötzsch-Sachs-Koester's conjecture
• Steinberg's conjecture is false
• On 3-colorability of planar graphs without adjacent short cycles
• Acyclic 4-choosability of planar graphs with neither 4-cycles nor triangular 6-cycles
• On 3-colorings of plane graphs
• On 3-colorable planar graphs without short cycles
• On the 3-colorability of planar graphs without 4-, 7- and 9-cycles
• A relaxation of the Bordeaux conjecture
• A new proof of Grünbaum's 3 color theorem
• Group connectivity and group colorings of graphs --- a survey
• Parity-constrained triangulations with Steiner points
• Every planar graph with cycles of length neither 4 nor 5 is \((1,1,0)\)-colorable
• Planar graphs without triangles adjacent to cycles of length from 4 to 7 are 3-colorable
• A step towards the strong version of Havel's three color conjecture
• Distance constraints on short cycles for 3-colorability of planar graphs
• \((1,0,0)\)-colorability of planar graphs without prescribed short cycles
• Every planar graph without 3-cycles adjacent to 4-cycles and without 6-cycles is (1, 1, 0)-colorable
• A structural theorem on embedded graphs and its application to colorings
• A Brooks-type result for sparse critical graphs
• \((1,0,0)\)-colorability of planar graphs without cycles of length \(4\) or \(6\)
• Plane graphs without cycles of length 4, 6, 7 or 8 are 3-colorable
• An introduction to the discharging method via graph coloring
• A sufficient condition for planar graphs to be 3-colorable
• Every planar graph without cycles of length 4 or 9 is \((1, 1, 0)\)-colorable
• Planar graphs without adjacent cycles of length at most seven are 3-colorable
• Improper colorability of planar graphs without prescribed short cycles
• Short proofs of coloring theorems on 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 6 are \((2,0,0)\)-colorable
• Planar graphs without cycles of length from 4 to 7 are 3-colorable
• A note on the three color problem
• On 3-colorable planar graphs without cycles of four lengths
• A 3-color theorem on plane graphs without 5-circuits
• On 3-colorable planar graphs without prescribed cycles
• Every planar graph without adjacent cycles of length at most 8 is 3-choosable
• Flexibility of planar graphs -- sharpening the tools to get lists of size four
• Title not available (Why is that?)
• Further extensions of the Grötzsch theorem
• Partitioning planar graphs without 4-cycles and 6-cycles into a linear forest and a forest
• Title not available (Why is that?)
• Concepts of signed graph coloring
• Edge 4-critical Koester graph of order 28
• Circular backbone colorings: on matching and tree backbones of planar graphs
• Partitioning planar graphs without 4-cycles and 5-cycles into bounded degree forests
• The Strong Fractional Choice Number and the Strong Fractional Paint Number of Graphs
• Every planar graph without 5-cycles and \(K_4^-\) and adjacent 4-cycles is \((2, 0, 0)\)-colorable
• Characterization of Cycle Obstruction Sets for Improper Coloring Planar Graphs
• (Circular) backbone colouring: forest backbones in planar graphs
• Choosability with union separation of planar graphs without cycles of length 4
• Planar graphs without 4- and 6-cycles are (7 : 2)-colorable
• Title not available (Why is that?)
• Mapping sparse signed graphs to (K2k,M) $({K}_{2k},M)$
• Every planar graph without 4-cycles and 5-cycles is (3,3)-colorable
• On dispersable book embeddings
• Title not available (Why is that?)
• Steinberg-like theorems for backbone colouring
• Steinberg-like theorems for backbone colouring
• Every planar graph without triangles adjacent to cycles of length 3 or 6 is \(( 1 , 1 , 1 )\)-colorable
• Planar graphs without 3-cycles adjacent to cycles of length 3 or 5 are \((3, 1)\)-colorable
• Decomposing a planar graph without triangular 4-cycles into a matching and a 3-colorable graph
• Title not available (Why is that?)
• Some of My Favorite Coloring Problems for Graphs and Digraphs

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3139765)