Pages that link to "Item:Q740267"
From MaRDI portal
The following pages link to List coloring the square of sparse graphs with large degree (Q740267):
Displaying 12 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)
- 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)
- Planar graphs of girth at least five are square \((\delta + 2)\)-choosable (Q1633752) (← links)
- List 2-distance coloring of planar graphs with girth five (Q2155644) (← links)
- On coloring numbers of graph powers (Q2174571) (← links)
- List \((p,q)\)-coloring of sparse plane graphs (Q2371265) (← links)
- Choosability of the square of a planar graph with maximum degree four (Q2876030) (← links)
- List-coloring the square of a subcubic graph (Q3539931) (← links)
- List-Coloring Squares of Sparse Subcubic Graphs (Q3614198) (← links)
- List Dynamic Coloring of Sparse Graphs (Q5199147) (← links)
