A rainbow about T-colorings for complete graphs

DOI10.1007/3-540-57899-4_52zbMath1530.05044OpenAlexW1505978186MaRDI QIDQ6143976

Klaus Jansen

Publication date: 5 January 2024

Published in: Graph-Theoretic Concepts in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-57899-4_52

zbMATH Keywords

greedy \(T\)-coloring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Cites Work

• \(T\)-colorings of graphs: recent results and open problems
• Further Results on T-Coloring and Frequency Assignment Problems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

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