Colorings of plane graphs: a survey
From MaRDI portal
Publication:1937564
DOI10.1016/j.disc.2012.11.011zbMath1259.05042OpenAlexW1994361334MaRDI QIDQ1937564
Publication date: 1 March 2013
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2012.11.011
Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)
Related Items (max. 100)
The entire choosability of plane graphs ⋮ On DP-coloring of graphs and multigraphs ⋮ The height of faces of 3-polytopes ⋮ Weight of edges in normal plane maps ⋮ A Steinberg-like approach to describing faces in 3-polytopes ⋮ Further extensions of the Grötzsch theorem ⋮ DP-3-coloring of some planar graphs ⋮ Graph polynomials and paintability of plane graphs ⋮ The weight of faces in normal plane maps ⋮ I,F-partitions of sparse graphs ⋮ Plurigraph coloring and scheduling problems ⋮ The asymptotic behavior of the correspondence chromatic number ⋮ Facial list colourings of plane graphs ⋮ Low 5-stars in normal plane maps with minimum degree 5 ⋮ Coloring of the square of Kneser graph \(K(2k+r,k)\) ⋮ 3-vertices with fewest 2-neighbors in plane graphs with no long paths of 2-vertices ⋮ Upper bound for DP-chromatic number of a graph ⋮ The chromatic number of signed graphs with bounded maximum average degree ⋮ Another tight description of faces in plane triangulations with minimum degree 4 ⋮ Planar graphs without normally adjacent short cycles ⋮ Describing neighborhoods of 5-vertices in a class of 3-polytopes with minimum degree 5 ⋮ Entire \((\varDelta +2)\)-colorability of plane graphs ⋮ Third case of the cyclic coloring conjecture ⋮ Three-colourability of planar graphs with no 5- or triangular \(\{3,6\}\)-cycles ⋮ Describing neighborhoods of 5-vertices in 3-polytopes with minimum degree 5 and without vertices of degrees from 7 to 11 ⋮ An extension of Kotzig's theorem ⋮ On the dominated chromatic number of certain graphs ⋮ Steinberg's conjecture is false ⋮ Combinatorial structure of faces in triangulations on surfaces ⋮ Choosability with union separation of planar graphs without cycles of length 4 ⋮ On star 5-colorings of sparse graphs ⋮ Refined weight of edges in normal plane maps ⋮ Facially-constrained colorings of plane graphs: a survey ⋮ Heights of minor faces in 3-polytopes ⋮ Cyclic coloring of plane graphs with maximum face size 16 and 17 ⋮ Every planar graph without triangles adjacent to cycles of length 3 or 6 is \(( 1 , 1 , 1 )\)-colorable ⋮ \((4,2)\)-choosability of planar graphs with forbidden structures ⋮ On the signed Roman \(k\)-domination: complexity and thin torus graphs ⋮ 3-coloring triangle-free planar graphs with a precolored 9-cycle ⋮ 2-distance coloring of planar graphs with girth 5 ⋮ Facial rainbow edge-coloring of plane graphs ⋮ 3-Coloring Triangle-Free Planar Graphs with a Precolored 9-Cycle ⋮ Planar graphs with $\Delta\geq 8$ are ($\Delta+1$)-edge-choosable ⋮ Every 3-polytope with minimum degree 5 has a 6-cycle with maximum degree at most 11 ⋮ Planar graphs without cycles of length 4 or 5 are (3,0,0)-colorable ⋮ Describing 3-faces in normal plane maps with minimum degree 4 ⋮ Describing faces in plane triangulations ⋮ Weight of 3-paths in sparse plane graphs ⋮ Planar graphs without 7-cycles and butterflies are DP-4-colorable ⋮ Light \(C_4\) and \(C_5\) in 3-polytopes with minimum degree 5 ⋮ Independent bondage number of planar graphs with minimum degree at least 3 ⋮ \(L(p,q)\)-labeling of a graph embeddable on the torus ⋮ An upper bound for the 3-tone chromatic number of graphs with maximum degree 3 ⋮ Bounding the chromatic number of squares of \(K_4\)-minor-free graphs ⋮ Planar graphs without 3-cycles adjacent to cycles of length 3 or 5 are \((3, 1)\)-colorable ⋮ Choosability with union separation ⋮ Facial entire colouring of plane graphs ⋮ Low stars in normal plane maps with minimum degree 4 and no adjacent 4-vertices ⋮ Planar graphs without 5-cycles and intersecting triangles are \((1, 1, 0)\)-colorable ⋮ The vertex-face weight of edges in 3-polytopes ⋮ A note on 3-choosability of plane graphs under distance restrictions ⋮ More about the height of faces in 3-polytopes ⋮ Short proofs of coloring theorems on planar graphs ⋮ On the cyclic coloring conjecture ⋮ Injective chromatic number of outerplanar graphs ⋮ Partitioning planar graphs without 4-cycles and 5-cycles into bounded degree forests ⋮ Combinatorial structure of faces in triangulated 3-polytopes with minimum degree 4 ⋮ Distance-two colourings of Barnette graphs ⋮ Distance constraints on short cycles for 3-colorability of planar graphs ⋮ An introduction to the discharging method via graph coloring ⋮ Correspondence coloring and its application to list-coloring planar graphs without cycles of lengths 4 to 8 ⋮ An improvement of Lebesgue's description of edges in 3-polytopes and faces in plane quadrangulations ⋮ Choosability with union separation of triangle-free planar graphs ⋮ Decomposing a planar graph without triangular 4-cycles into a matching and a 3-colorable graph ⋮ 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 the weight of minor faces in triangle-free 3-polytopes ⋮ Every triangulated 3-polytope of minimum degree 4 has a 4-path of weight at most 27 ⋮ Structure of edges in plane graphs with bounded dual edge weight ⋮ Third Case of the Cyclic Coloring Conjecture ⋮ On Choosability with Separation of Planar Graphs with Forbidden Cycles ⋮ Low edges in 3-polytopes ⋮ Low minor faces in 3-polytopes ⋮ Planar 4-critical graphs with four triangles ⋮ Entire coloring of plane graph with maximum degree eleven ⋮ Tight description of faces in torus triangulations with minimum degree 5 ⋮ Planar graphs without cycles of length from 4 to 7 and intersecting triangles are DP-3-colorable ⋮ Facial rainbow coloring of plane graphs ⋮ Coloring drawings of graphs ⋮ A relaxation of Novosibirsk 3-color conjecture ⋮ Cover and variable degeneracy ⋮ Planar graphs without cycles of length 4 or 5 are \((11 : 3)\)-colorable ⋮ DP-4-colorability of two classes of planar graphs ⋮ Describing faces in 3-polytopes with no vertices of degree from 5 to 7 ⋮ Adjacent vertex distinguishing total coloring of planar graphs with maximum degree 8 ⋮ Low faces of restricted degree in 3-polytopes ⋮ On the largest planar graphs with everywhere positive combinatorial curvature ⋮ Note on 3-paths in plane graphs of girth 4 ⋮ A relaxation of the Bordeaux conjecture ⋮ All subgraphs of a wheel are 5-coupled-choosable
This page was built for publication: Colorings of plane graphs: a survey
