Bounding the chromatic number of dense digraphs by arc neighborhoods

DOI10.1007/s00493-024-00098-zMaRDI QIDQ6607842

Alantha Newman, Felix Klingelhoefer

Publication date: 19 September 2024

Published in: Combinatorica (Search for Journal in Brave)

zbMATH Keywords

tournamentsdichromatic numberforbidden induced subtournaments

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (1)

Coloring tournaments with few colors: algorithms and complexity

This page was built for publication: Bounding the chromatic number of dense digraphs by arc neighborhoods