Graphs with maximum degree 17 and maximum average degree less than 3 are list 2-distance ( +2)-colorable
DOI10.1016/J.DISC.2013.10.022zbMATH Open1279.05020OpenAlexW2237579535MaRDI QIDQ393358FDOQ393358
Authors: Marthe Bonamy, Benjamin Lévêque, Alexandre Pinlou
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
Recommendations
- List 2-distance coloring of graphs with maximum degree 5
- List 2-distance coloring of planar graphs with maximal degree less than 5
- List \(r\)-hued chromatic number of graphs with bounded maximum average degrees
- scientific article; zbMATH DE number 6004909
- List 2-distance \((\Delta+1)\)-coloring of planar graphs with girth at least 7
- The list 2-distance coloring of a graph with \(\Delta(G)=5\)
- List \(r\)-dynamic coloring of graphs with small maximum average degree
- List 3-dynamic coloring of graphs with small maximum average degree
- Neighbor sum distinguishing colorings of graphs with maximum average degree less than \(\frac{37} {12}\)
- 2-distance list \((\varDelta +3)\)-coloring of sparse graphs
Extremal problems in graph theory (05C35) Distance in graphs (05C12) Coloring of graphs and hypergraphs (05C15)
Cites Work
- Every planar map is four colorable. I: Discharging
- Every planar map is four colorable. II: Reducibility
- Title not available (Why is that?)
- List injective colorings of planar graphs
- 2-distance \((\varDelta +2)\)-coloring of planar graphs with girth six and \(\varDelta \geq 18\)
- 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
- Labeling Planar Graphs with Conditions on Girth and Distance Two
- Choosability conjectures and multicircuits
- On the injective chromatic number of graphs
- Injective \((\Delta + 1)\)-coloring of planar graphs with girth 6
- List 2-distance \((\varDelta +2)\)-coloring of planar graphs with girth six
- Sufficient conditions for the minimum 2-distance colorability of plane graphs of girth 6
- List Colouring Squares of Planar Graphs
- Title not available (Why is that?)
Cited In (23)
- Combinatorial upper bounds for the smallest eigenvalue of a graph
- 2-distance coloring of planar graphs without adjacent 5-cycles
- \(2\)-distance choice number of planar graphs with maximal degree no more than 4
- The list 2-distance coloring of a graph with \(\Delta(G)=5\)
- 2-distance list \((\varDelta +3)\)-coloring of sparse graphs
- 2-distance coloring of a planar graph without 3, 4, 7-cycles
- List coloring the square of sparse graphs with large degree
- Sufficient sparseness conditions for \(G^2\) to be \((\Delta + 1)\)-choosable, when \(\Delta \geq 5\)
- 2-distance \((\Delta + 1)\)-coloring of sparse graphs using the potential method
- Coloring the square of graphs whose maximum average degree is less than 4
- List 2-distance \(\varDelta +3\)-coloring of planar graphs without 4,5-cycles
- The 2-distance chromatic number of planar graphs without 3,4,8-cycles
- On list \(r\)-hued coloring of planar graphs
- \(2\)-distance coloring of planar graph
- Planar graphs of girth at least five are square \((\delta + 2)\)-choosable
- A new result of list 2-distance coloring of planar graphs with \(g(G) \geq 5\)
- Graph \(r\)-hued colorings -- a survey
- 2-distance list \((\Delta +2)\)-coloring of planar graphs with girth at least 10
- Sharp upper bound of injective coloring of planar graphs with girth at least 5
- An introduction to the discharging method via graph coloring
- 2-distance choosability of planar graphs with a restriction for maximum degree
- \(r\)-hued \((r+1)\)-coloring of planar graphs with girth at least 8 for \(r\geq 9\)
- 2-distance colorings of integer distance graphs
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
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q393358)