Some results on list \(T\)-colourings

DOI10.1016/S0012-365X(96)00349-4zbMath0895.05024MaRDI QIDQ1377778

Adrian O. Waller

Publication date: 14 September 1998

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

\(T\)-colouring\(T\)-choice number

Mathematics Subject Classification ID

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

Related Items (2)

Choosability of graphs with infinite sets of forbidden differences ⋮ A short proof of a conjecture on the \(T_r\)-choice number of even cycles

Cites Work

• Unnamed Item
• \(T\)-colorings of graphs: recent results and open problems
• List \(T\)-colorings of graphs
• An Upper Bound for List T -Colourings

This page was built for publication: Some results on list \(T\)-colourings