Graphs with maximum degree \(\varDelta\geq 17\) and maximum average degree less than 3 are list 2-distance \((\varDelta +2)\)-colorable
From MaRDI portal
Publication:393358
DOI10.1016/j.disc.2013.10.022zbMath1279.05020OpenAlexW2237579535MaRDI QIDQ393358
Alexandre Pinlou, Marthe Bonamy, Benjamin Lévêque
Publication date: 17 January 2014
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2013.10.022
Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15) Distance in graphs (05C12)
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 ⋮ 2-distance coloring of a planar graph without 3, 4, 7-cycles ⋮ 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 ⋮ Graph \(r\)-hued colorings -- a survey ⋮ A new result of list 2-distance coloring of planar graphs with g(G) ≥ 5 ⋮ On list \(r\)-hued coloring of planar graphs ⋮ 2-distance coloring of planar graphs without adjacent 5-cycles ⋮ Coloring the square of graphs whose maximum average degree is less than 4 ⋮ 2-distance choosability of planar graphs with a restriction for maximum degree ⋮ 2-distance colorings of integer distance graphs ⋮ \(r\)-hued \((r+1)\)-coloring of planar graphs with girth at least 8 for \(r\geq 9\) ⋮ An introduction to the discharging method via graph coloring ⋮ Sufficient sparseness conditions for \(G^2\) to be \((\Delta + 1)\)-choosable, when \(\Delta \geq 5\) ⋮ 2-Distance coloring of planar graph ⋮ The list 2-distance coloring of a graph with Δ(G) = 5 ⋮ 2-distance choice number of planar graphs with maximal degree no more than 4
Cites Work
- Unnamed Item
- Unnamed Item
- Injective \((\Delta + 1)\)-coloring of planar graphs with girth 6
- List injective colorings of planar graphs
- List 2-distance \((\varDelta +2)\)-coloring of planar graphs with girth six
- 2-distance \((\varDelta +2)\)-coloring of planar graphs with girth six and \(\varDelta \geq 18\)
- Every planar map is four colorable. I: Discharging
- Every planar map is four colorable. II: Reducibility
- On the injective chromatic number of graphs
- Sufficient conditions for the minimum 2-distance colorability of plane graphs of girth 6
- Coloring squares of planar graphs with girth six
- Sufficient conditions for planar graphs to be 2-distance (\(\Delta+1\))-colourable
- 2-distance coloring of sparse planar graphs
- List Colouring Squares of Planar Graphs
- Labeling Planar Graphs with Conditions on Girth and Distance Two
- Choosability conjectures and multicircuits
This page was built for publication: Graphs with maximum degree \(\varDelta\geq 17\) and maximum average degree less than 3 are list 2-distance \((\varDelta +2)\)-colorable
