A Brooks-Type Theorem for the Generalized List T-Coloring

DOI10.1137/S0895480103437870zbMath1093.05024WikidataQ57601542 ScholiaQ57601542MaRDI QIDQ5470781

Jiří Fiala, Riste Škrekovski, Daniel Král'

Publication date: 1 June 2006

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

zbMATH Keywords

graph coloring\(T\)-coloringchannel assignment problemBrooks' theorem

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (6)

Some new bounds on \(T_{r}\)-choosability ⋮ A Brooks‐Type Theorem for the Bichromatic Number ⋮ \(T_r\)-span of directed wheel graphs ⋮ Choosability of graphs with infinite sets of forbidden differences ⋮ Hard coloring problems in low degree planar bipartite graphs ⋮ The last excluded case of Dirac's map‐color theorem for choosability

This page was built for publication: A Brooks-Type Theorem for the Generalized List T-Coloring