2-distance list \((\Delta +2)\)-coloring of planar graphs with girth at least 10
From MaRDI portal
Publication:2165285
DOI10.1007/s10878-022-00883-wOpenAlexW3203986755MaRDI QIDQ2165285
Publication date: 19 August 2022
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2109.14499
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An improved bound on 2-distance coloring plane graphs with girth 5
- Graphs with maximum degree \(\varDelta\geq 17\) and maximum average degree less than 3 are list 2-distance \((\varDelta +2)\)-colorable
- On 2-distance coloring of plane graphs with girth 5
- List 2-facial 5-colorability of plane graphs with girth at least 12
- Coloring the square of a \(K_{4}\)-minor free graph
- Planar graphs of girth at least five are square \((\delta + 2)\)-choosable
- 2-distance coloring of planar graphs with girth 5
- The square of a planar cubic graph is 7-colorable
- An optimal square coloring of planar graphs
- \(r\)-hued \((r+1)\)-coloring of planar graphs with girth at least 8 for \(r\geq 9\)
- Coloring squares of planar graphs with girth six
- Sufficient conditions for planar graphs to be 2-distance (\(\Delta+1\))-colourable
- List 2-distance coloring of planar graphs without short cycles
- Choosability of the square of a planar graph with maximum degree four
- List Colouring Squares of Planar Graphs
- List-coloring the square of a subcubic graph
- The list 2-distance coloring of a graph with Δ(G) = 5
- Channel assignment with \(r\)-dynamic coloring
This page was built for publication: 2-distance list \((\Delta +2)\)-coloring of planar graphs with girth at least 10
