Multigraphs with \(\Delta \geq 3\) are totally-\((2\Delta - 1)\)-choosable

DOI10.1007/S00373-008-0817-5zbMath1221.05133arXiv1308.3038OpenAlexW2069022115MaRDI QIDQ1043786

Daniel W. Cranston

Publication date: 9 December 2009

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1308.3038

zbMATH Keywords

multigraphchoosabilitytotal coloringlist coloring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Cites Work

• List edge and list total colourings of multigraphs
• The list chromatic index of a bipartite multigraph
• List Total Colourings of Graphs
• COLORING ALGORITHMS ON SUBCUBIC GRAPHS

This page was built for publication: Multigraphs with \(\Delta \geq 3\) are totally-\((2\Delta - 1)\)-choosable