A rainbow about \(T\)-colorings for complete graphs

DOI10.1016/0012-365X(94)00344-IzbMath0852.05047OpenAlexW2082504553MaRDI QIDQ1918544

Klaus Jansen

Publication date: 25 November 1996

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

Full work available at URL: https://doi.org/10.1016/0012-365x(94)00344-i

zbMATH Keywords

rainbow\(T\)-spancomplete graph\(T\)-colouring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (5)

\(T\)-coloring of certain networks ⋮ The complexity of the \(T\)-coloring problem for graphs with small degree ⋮ A polynomial algorithm for finding \(T\)-span of generalized cacti ⋮ Greedy \(T\)-colorings of graphs ⋮ Distance graphs and the \(T\)-coloring problem

Cites Work

• \(T\)-colorings of graphs: recent results and open problems
• Optimal multiple interval assignments in frequency assignment and traffic phasing
• List \(T\)-colorings of graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A rainbow about \(T\)-colorings for complete graphs