Pages that link to "Item:Q2876030"
From MaRDI portal
The following pages link to Choosability of the square of a planar graph with maximum degree four (Q2876030):
Displaying 16 items.
- An introduction to the discharging method via graph coloring (Q507506) (← links)
- List coloring the square of sparse graphs with large degree (Q740267) (← links)
- Sufficient sparseness conditions for \(G^2\) to be \((\Delta + 1)\)-choosable, when \(\Delta \geq 5\) (Q741736) (← links)
- List 2-distance coloring of planar graphs (Q887861) (← links)
- List-colouring the square of a \(K_4\)-minor-free graph (Q941324) (← links)
- Choosability of the square of planar subcubic graphs with large girth (Q1025548) (← 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)
- Degeneracy and colorings of squares of planar graphs without 4-cycles (Q2658379) (← links)
- Coloring squares of planar graphs with maximum degree at most five (Q2689129) (← links)
- Graphs of degree 4 are 5-edge-choosable (Q4718735) (← links)
- Improper choosability of graphs and maximum average degree (Q5486272) (← links)
- Square Coloring Planar Graphs with Automatic Discharging (Q6141869) (← links)
- Relaxation of Wegner's planar graph conjecture for maximum degree 4 (Q6611072) (← links)
- 2-distance \((\Delta + 1)\)-coloring of sparse graphs using the potential method (Q6635121) (← links)
