Total choosability of multicircuits II

DOI10.1002/JGT.10030zbMATH Open0998.05021OpenAlexW4248110382MaRDI QIDQ4537555FDOQ4537555

Alexandr Kostochka, Douglas R. Woodall

Publication date: 1 July 2002

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.10030

zbMATH Keywords

total chromatic numbertotal choosabilitymulticircuitlist-total-colouring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• List edge colourings of some 1-factorable multigraphs
• Colorings and orientations of graphs
• Choosability conjectures and multicircuits
• New Bounds on the List-Chromatic Index of the Complete Graph and Other Simple Graphs
• A solution to a colouring problem of P. Erdős
• Total choosability of multicircuits I

Cited In (4)

• COLORING ALGORITHMS ON SUBCUBIC GRAPHS
• Total equitable list coloring
• Choosability conjectures and multicircuits
• Total choosability of multicircuits I

This page was built for publication: Total choosability of multicircuits II

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