An Upper Bound for List T -Colourings

DOI10.1112/blms/28.4.337zbMath0854.05047OpenAlexW2149834681MaRDI QIDQ4893602

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

colouringchoosabilitychoice number

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (2)

Some results on list \(T\)-colourings ⋮ Choosability of graphs with infinite sets of forbidden differences

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