Structural theorem on plane graphs with application to the entire coloring number
From MaRDI portal
Publication:4715277
DOI<233::AID-JGT3>3.0.CO;2-T 10.1002/(SICI)1097-0118(199611)23:3<233::AID-JGT3>3.0.CO;2-TzbMath0863.05035OpenAlexW4240225219MaRDI QIDQ4715277
Publication date: 12 November 1996
Full work available at URL: https://doi.org/10.1002/(sici)1097-0118(199611)23:3<233::aid-jgt3>3.0.co;2-t
Structural characterization of families of graphs (05C75) Coloring of graphs and hypergraphs (05C15)
Related Items
The entire choosability of plane graphs ⋮ Edge-partitions of graphs of nonnegative characteristic and their game coloring numbers ⋮ Weight of edges in normal plane maps ⋮ The edge-face choosability of plane graphs ⋮ An analogue of Franklin's theorem ⋮ Plane graphs with maximum degree 9 are entirely 11-choosable ⋮ Facial list colourings of plane graphs ⋮ Entire \((\varDelta +2)\)-colorability of plane graphs ⋮ An extension of Kotzig's theorem ⋮ The entire chromatic number of graphs embedded on the torus with large maximum degree ⋮ Plane Graphs with Maximum Degree Are Entirely ‐Colorable ⋮ Entire coloring of 2-connected plane graphs ⋮ On doubly light triangles in plane graphs ⋮ Every 3-polytope with minimum degree 5 has a 6-cycle with maximum degree at most 11 ⋮ Plane graphs with \(\Delta = 7\) are entirely 10-colorable ⋮ Light \(C_4\) and \(C_5\) in 3-polytopes with minimum degree 5 ⋮ Simultaneous coloring of vertices and incidences of outerplanar graphs ⋮ Facial entire colouring of plane graphs ⋮ Upper bounds on the linear chromatic number of a graph ⋮ Entire colouring of plane graphs ⋮ An introduction to the discharging method via graph coloring ⋮ Describing 4-paths in 3-polytopes with minimum degree 5 ⋮ Entire coloring of graphs embedded in a surface of nonnegative characteristic ⋮ M-degrees of quadrangle-free planar graphs ⋮ Each 3-polytope with minimum degree 5 has a 7-cycle with maximum degree at most 15 ⋮ The entire coloring of series-parallel graphs
