Some totally 4-choosable multigraphs

DOI10.7151/DMGT.1372MaRDI QIDQ3504798zbMATH OpenOpenAlexFDO

Authors Douglas R. Woodall

Publication date 18 June 2008

Published in Discussiones Mathematicae Graph Theory (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/cefe23fa27042027b779646aabd9033c49e4c13b

zbMATH Keywords

list total colouringmaximum average degreeplanar graphtotal choosability

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Extremal problems in graph theory (05C35)

Recommendations

• List Total Colourings of Graphs
• Total colourings of planar graphs with large girth
• Total choosability of planar graphs with maximum degree 4
• Total 4-choosability of series-parallel graphs
• Edge and total choosability of near-outerplanar graphs

Cited in

(8)

• Multigraphs with \(\Delta \geq 3\) are totally-\((2\Delta - 1)\)-choosable
• Facial list colourings of plane graphs
• List Total Colourings of Graphs
• Adaptable and conflict colouring multigraphs with no cycles of length three or four
• Total choosability of planar graphs with maximum degree 4
• On the choice number of complete multipartite graphs with part size four
• Total 4-choosability of series-parallel graphs
• The average degree of a multigraph critical with respect to edge or total choosability

This page was built for publication: Some totally 4-choosable multigraphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3504798)