scientific article; zbMATH DE number 434910

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)

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

Cited in

(only showing first 100 items - show all)

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

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)