Divisibility and \(T\)-span of graphs

DOI10.1016/S0012-365X(00)00378-2zbMath0997.05035WikidataQ126843786 ScholiaQ126843786MaRDI QIDQ5936063

Robert Janczewski

Publication date: 17 November 2002

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

zbMATH Keywords

greedy algorithmchromatic number\(T\)-coloring\(T\)-spandivisibility

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Applications of graph theory to circuits and networks (94C15)

Related Items (2)

The complexity of the \(T\)-coloring problem for graphs with small degree ⋮ \(T\)-colorings, divisibility and the circular chromatic number

This page was built for publication: Divisibility and \(T\)-span of graphs