Pages that link to "Item:Q741736"
From MaRDI portal
The following pages link to Sufficient sparseness conditions for \(G^2\) to be \((\Delta + 1)\)-choosable, when \(\Delta \geq 5\) (Q741736):
Displayed 5 items.
- Coloring the square of a sparse graph \(G\) with almost \(\varDelta(G)\) colors (Q317434) (← links)
- An introduction to the discharging method via graph coloring (Q507506) (← links)
- Optimal channel assignment and \(L(p,1)\)-labeling (Q1630278) (← links)
- 2-distance choosability of planar graphs with a restriction for maximum degree (Q2698256) (← links)
- The list 2-distance coloring of a graph with Δ(G) = 5 (Q5261051) (← links)