Pages that link to "Item:Q393358"
From MaRDI portal
The following pages link to Graphs with maximum degree \(\varDelta\geq 17\) and maximum average degree less than 3 are list 2-distance \((\varDelta +2)\)-colorable (Q393358):
Displaying 18 items.
- 2-distance coloring of a planar graph without 3, 4, 7-cycles (Q328716) (← links)
- An introduction to the discharging method via graph coloring (Q507506) (← links)
- Sufficient sparseness conditions for \(G^2\) to be \((\Delta + 1)\)-choosable, when \(\Delta \geq 5\) (Q741736) (← links)
- Coloring the square of graphs whose maximum average degree is less than 4 (Q906469) (← links)
- List 2-distance \(\varDelta +3\)-coloring of planar graphs without 4,5-cycles (Q1631690) (← links)
- Planar graphs of girth at least five are square \((\delta + 2)\)-choosable (Q1633752) (← links)
- On list \(r\)-hued coloring of planar graphs (Q1680495) (← links)
- 2-distance colorings of integer distance graphs (Q1717215) (← links)
- Sharp upper bound of injective coloring of planar graphs with girth at least 5 (Q2165276) (← links)
- 2-distance list \((\Delta +2)\)-coloring of planar graphs with girth at least 10 (Q2165285) (← links)
- Graph \(r\)-hued colorings -- a survey (Q2172387) (← links)
- \(r\)-hued \((r+1)\)-coloring of planar graphs with girth at least 8 for \(r\geq 9\) (Q2225423) (← links)
- 2-distance choosability of planar graphs with a restriction for maximum degree (Q2698256) (← links)
- A new result of list 2-distance coloring of planar graphs with g(G) ≥ 5 (Q4577850) (← links)
- 2-Distance coloring of planar graph (Q5012803) (← links)
- 2-distance choice number of planar graphs with maximal degree no more than 4 (Q5025121) (← links)
- The list 2-distance coloring of a graph with Δ(G) = 5 (Q5261051) (← links)
- 2-distance coloring of planar graphs without adjacent 5-cycles (Q6166190) (← links)