An Upper Bound for List T -Colourings

DOI10.1112/BLMS/28.4.337MaRDI QIDQ4893602zbMATH OpenOpenAlexFDO

Authors Adrian O. Waller

Publication date 13 January 1997

Published in Bulletin of the London Mathematical Society (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1112/blms/28.4.337

zbMATH Keywords

choice numberchoosabilitycolouring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Recommendations

• Some results on list \(T\)-colourings
• A new upper bound for the list chromatic number
• On the number of list‐colorings
• scientific article; zbMATH DE number 1383704
• scientific article; zbMATH DE number 2191977
• List Set Colouring: Bounds and Algorithms
• An upper bound for total colouring of graphs
• List T-colorings of graphs
• A Brooks-Type Theorem for the Generalized List T-Coloring
• A relaxed Hadwiger's conjecture for list colorings

Cited in

(8)

• List T-colorings of graphs
• Some results on list \(T\)-colourings
• \(T\)-choosability in graphs
• Asymptotically the list colouring constants are 1
• Choosability of graphs with infinite sets of forbidden differences
• Some new bounds on \(T_{r}\)-choosability
• scientific article; zbMATH DE number 1496580 (Why is no real title available?)
• scientific article; zbMATH DE number 1553748 (Why is no real title available?)

This page was built for publication: An Upper Bound for List T -Colourings

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