Coloring squares of planar graphs with girth six
From MaRDI portal
Publication:2427536
DOI10.1016/j.ejc.2007.11.005zbMath1143.05027OpenAlexW2028038654WikidataQ57601488 ScholiaQ57601488MaRDI QIDQ2427536
Riste Škrekovski, Pavel Nejedlý, Zdeněk Dvořák, Daniel Král'
Publication date: 13 May 2008
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejc.2007.11.005
Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)
Related Items
List 2-distance \(\varDelta +3\)-coloring of planar graphs without 4,5-cycles ⋮ Planar graphs of girth at least five are square \((\delta + 2)\)-choosable ⋮ An improved bound on 2-distance coloring plane graphs with girth 5 ⋮ Coloring the square of a sparse graph \(G\) with almost \(\varDelta(G)\) colors ⋮ 2-distance coloring of a planar graph without 3, 4, 7-cycles ⋮ List 2-distance coloring of planar graphs with girth five ⋮ Sharp upper bound of injective coloring of planar graphs with girth at least 5 ⋮ 2-distance list \((\Delta +2)\)-coloring of planar graphs with girth at least 10 ⋮ 2-Distance Coloring of Sparse Graphs ⋮ Degeneracy and colorings of squares of planar graphs without 4-cycles ⋮ Graph \(r\)-hued colorings -- a survey ⋮ On coloring numbers of graph powers ⋮ A new result of list 2-distance coloring of planar graphs with g(G) ≥ 5 ⋮ 2-distance coloring of planar graphs with girth 5 ⋮ An optimal square coloring of planar graphs ⋮ The square of a planar cubic graph is 7-colorable ⋮ Graphs with maximum degree \(\varDelta\geq 17\) and maximum average degree less than 3 are list 2-distance \((\varDelta +2)\)-colorable ⋮ List injective colorings of planar graphs ⋮ Coloring the square of graphs whose maximum average degree is less than 4 ⋮ List \(r\)-hued chromatic number of graphs with bounded maximum average degrees ⋮ 2-distance colorings of integer distance graphs ⋮ List 2-facial 5-colorability of plane graphs with girth at least 12 ⋮ \(r\)-hued \((r+1)\)-coloring of planar graphs with girth at least 8 for \(r\geq 9\) ⋮ Coloring the square of Sierpiński graphs ⋮ On the existence of specific stars in planar graphs ⋮ An introduction to the discharging method via graph coloring ⋮ On 2-distance coloring of plane graphs with girth 5 ⋮ Parameterized complexity of coloring problems: treewidth versus vertex cover ⋮ Injective \((\Delta + 1)\)-coloring of planar graphs with girth 6 ⋮ Distance constrained labelings of planar graphs with no short cycles ⋮ Coloring the square of the Cartesian product of two cycles ⋮ Injective colorings of sparse graphs ⋮ 3-dynamic coloring of planar triangulations ⋮ List injective coloring of planar graphs with girth \(g \geq 6\) ⋮ List coloring the square of sparse graphs with large degree ⋮ The \(L(p, q)\)-labelling of planar graphs without 4-cycles ⋮ List 2-distance \((\varDelta +2)\)-coloring of planar graphs with girth six ⋮ List‐Coloring the Squares of Planar Graphs without 4‐Cycles and 5‐Cycles ⋮ 2-Distance Coloring of Planar Graphs without 4-Cycles and 5-Cycles ⋮ \(L(p, q)\)-labeling of planar graphs with small girth ⋮ Injective colorings of planar graphs with few colors ⋮ 2-distance \((\varDelta +2)\)-coloring of planar graphs with girth six and \(\varDelta \geq 18\) ⋮ Optimal frequency assignment and planar list \(L(2, 1)\)-labeling ⋮ 2-Distance chromatic number of some graph products ⋮ The list 2-distance coloring of a graph with Δ(G) = 5 ⋮ Linear-time algorithms for tree root problems
Cites Work
- A bound on the chromatic number of the square of a planar graph
- Sufficient conditions for planar graphs to be 2-distance (\(\Delta+1\))-colourable
- 2-distance coloring of sparse planar graphs
- The Chromatic Number of Graph Powers
- On the structural result on normal plane maps
- Coloring Powers of Planar Graphs
- Labeling Planar Graphs with Conditions on Girth and Distance Two
- Coloring the square of a planar graph
- 25 pretty graph colouring problems
- Local structures in plane maps and distance colourings
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
