List Total Colourings of Graphs
From MaRDI portal
Publication:4212879
DOI10.1017/S0963548397003210zbMath0911.05033MaRDI QIDQ4212879
Bojan Mohar, Riste Škrekovski, Martin Juvan
Publication date: 4 May 1999
Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)
Related Items (19)
On group choosability of total graphs ⋮ Maximum average degree of list-edge-critical graphs and Vizing's conjecture ⋮ List total coloring of pseudo-outerplanar graphs ⋮ Total choosability of planar graphs with maximum degree 4 ⋮ Every planar graph with Δ ${\rm{\Delta }}$ ⩾ 8 is totally (Δ+2) $({\rm{\Delta }}+2)$‐choosable ⋮ On the total choosability of planar graphs and of sparse graphs ⋮ The list edge coloring and list total coloring of planar graphs with maximum degree at least 7 ⋮ List total colorings of planar graphs without triangles at small distance ⋮ (\( \Delta + 1\))-total choosability of planar graphs with no cycles of length from 4 to \(k\) and without close triangles ⋮ Edge choosability and total choosability of planar graphs with no 3-cycles adjacent 4-cycles ⋮ Unnamed Item ⋮ Minimum total coloring of planar graph ⋮ COLORING ALGORITHMS ON SUBCUBIC GRAPHS ⋮ List edge and list total coloring of 1-planar graphs ⋮ The average degree of a multigraph critical with respect to edge or total choosability ⋮ Combinatorial Nullstellensatz and DP-coloring of graphs ⋮ Planar graphs without 5-cycles or without 6-cycles ⋮ Multigraphs with \(\Delta \geq 3\) are totally-\((2\Delta - 1)\)-choosable ⋮ Total colorings and list total colorings of planar graphs without intersecting 4-cycles
This page was built for publication: List Total Colourings of Graphs
