Infinite families of -dichromatic vertex critical circulant tournaments

DOI10.1016/j.endm.2007.01.020zbMath1291.05078OpenAlexW2070089525MaRDI QIDQ3439577

Mika Olsen, Gabriela Araujo-Pardo

Publication date: 29 May 2007

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

Full work available at URL: https://doi.org/10.1016/j.endm.2007.01.020

zbMATH Keywords

digraphdichromatic numbercirculant tournament

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Directed graphs (digraphs), tournaments (05C20)

Cites Work

• Unnamed Item
• Unnamed Item
• Vertex critical r-dichromatic tournaments
• The acyclic disconnection of a digraph
• The 3 and 4-dichromatic tournaments of minimum order
• Vertex critical 4-dichromatic circulant tournaments
• On tournaments free of large transitive subtournaments
• The dichromatic number of a digraph
• Dichromatic number, circulant tournaments and Zykov sums of digraphs
• Disproof of a conjecture of Erdös and moser on tournaments

This page was built for publication: Infinite families of -dichromatic vertex critical circulant tournaments