The list 2-distance coloring of a graph with (G)=5
From MaRDI portal
Publication:5261051
Recommendations
- List 2-distance coloring of graphs with maximum degree 5
- The list 2-distance coloring of sparse graphs
- 2-distance list \((\varDelta +3)\)-coloring of sparse graphs
- Graphs with maximum degree 17 and maximum average degree less than 3 are list 2-distance ( +2)-colorable
- List 2-distance coloring of planar graphs with maximal degree less than 5
Cites work
- 2-distance \((\varDelta +2)\)-coloring of planar graphs with girth six and \(\varDelta \geq 18\)
- Coloring squares of planar graphs with girth six
- Coloring the square of a \(K_{4}\)-minor free graph
- Graphs with maximum degree \(\varDelta\geq 17\) and maximum average degree less than 3 are list 2-distance \((\varDelta +2)\)-colorable
- List 2-distance \((\varDelta +2)\)-coloring of planar graphs with girth six
- Sufficient sparseness conditions for \(G^2\) to be \((\Delta + 1)\)-choosable, when \(\Delta \geq 5\)
Cited in
(10)- List 2-distance coloring of graphs with maximum degree 5
- The list 2-distance coloring of sparse graphs
- List 2-distance coloring of planar graphs with girth five
- Graphs with maximum degree \(\varDelta\geq 17\) and maximum average degree less than 3 are list 2-distance \((\varDelta +2)\)-colorable
- Linear list colorings of graphs with maximum average degrees bounded.
- \(r\)-hued \((r+1)\)-coloring of planar graphs with girth at least 8 for \(r\geq 9\)
- 2-distance list \((\varDelta +3)\)-coloring of sparse graphs
- Graph \(r\)-hued colorings -- a survey
- 2-distance \((\Delta + 1)\)-coloring of sparse graphs using the potential method
- 2-distance list \((\Delta +2)\)-coloring of planar graphs with girth at least 10
This page was built for publication: The list 2-distance coloring of a graph with \(\Delta(G)=5\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5261051)
