Pages that link to "Item:Q317434"
From MaRDI portal
The following pages link to Coloring the square of a sparse graph \(G\) with almost \(\varDelta(G)\) colors (Q317434):
Displaying 7 items.
- 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)
- Coloring squares of graphs with mad constraints (Q2009007) (← links)
- Graph \(r\)-hued colorings -- a survey (Q2172387) (← links)
- Coloring squares of planar graphs with girth six (Q2427536) (← links)
- Upper bound on chromatic number of square graph of sparse graphs (Q3385887) (← links)
