A conjecture of Neumann-Lara on infinite families of \(r\)-dichromatic circulant tournaments

DOI10.1016/j.disc.2009.03.028zbMath1185.05071OpenAlexW2138747901WikidataQ123258586 ScholiaQ123258586MaRDI QIDQ960957

Gabriela Araujo-Pardo, Mika Olsen

Publication date: 29 March 2010

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

Full work available at URL: https://doi.org/10.1016/j.disc.2009.03.028

zbMATH Keywords

dichromatic numbervertex criticalcirculant tournament

Mathematics Subject Classification ID

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

Related Items (9)

Extendiendo un resultado de coloraciones de gráficas a coloraciones de digráficas ⋮ The digrundy number of digraphs ⋮ Digraphs and Variable Degeneracy ⋮ Disproof of a conjecture of Neumann-Lara ⋮ On a Conjecture of Víctor Neumann-Lara ⋮ The dichromatic number of infinite families of circulant tournaments ⋮ The edge density of critical digraphs ⋮ The diachromatic number of digraphs ⋮ Tournaments and Semicomplete Digraphs

Cites Work

• Unnamed Item
• 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
• On a Conjecture of Víctor Neumann-Lara
• Disproof of a conjecture of Erdös and moser on tournaments

This page was built for publication: A conjecture of Neumann-Lara on infinite families of \(r\)-dichromatic circulant tournaments