The following pages link to List Total Colourings of Graphs (Q4212879):
Displaying 18 items.
- List total coloring of pseudo-outerplanar graphs (Q393451) (← links)
- On the total choosability of planar graphs and of sparse graphs (Q407575) (← links)
- (\( \Delta + 1\))-total choosability of planar graphs with no cycles of length from 4 to \(k\) and without close triangles (Q432709) (← links)
- Minimum total coloring of planar graph (Q475814) (← links)
- Total choosability of planar graphs with maximum degree 4 (Q617905) (← links)
- Edge choosability and total choosability of planar graphs with no 3-cycles adjacent 4-cycles (Q641187) (← links)
- List edge and list total coloring of 1-planar graphs (Q692658) (← links)
- The average degree of a multigraph critical with respect to edge or total choosability (Q966012) (← links)
- Planar graphs without 5-cycles or without 6-cycles (Q1025913) (← links)
- Multigraphs with \(\Delta \geq 3\) are totally-\((2\Delta - 1)\)-choosable (Q1043786) (← links)
- Total colorings and list total colorings of planar graphs without intersecting 4-cycles (Q1045095) (← links)
- List total colorings of planar graphs without triangles at small distance (Q1942193) (← links)
- Combinatorial Nullstellensatz and DP-coloring of graphs (Q2005703) (← links)
- The list edge coloring and list total coloring of planar graphs with maximum degree at least 7 (Q2194528) (← links)
- On group choosability of total graphs (Q2376095) (← links)
- Maximum average degree of list-edge-critical graphs and Vizing's conjecture (Q5054037) (← links)
- COLORING ALGORITHMS ON SUBCUBIC GRAPHS (Q5696963) (← links)
- Every planar graph with Δ ${\rm{\Delta }}$ ⩾ 8 is totally (Δ+2) $({\rm{\Delta }}+2)$‐choosable (Q6047966) (← links)
