Disproof of a conjecture of Neumann-Lara

zbMath1372.05089MaRDI QIDQ2409837

Mika Olsen, Bernardo Llano

Publication date: 16 October 2017

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: http://www.combinatorics.org/ojs/index.php/eljc/article/view/v24i4p5

zbMATH Keywords

acyclic disconnectioncirculant tournamentsdichomatic number

Mathematics Subject Classification ID

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

Related Items (2)

The digrundy number of digraphs ⋮ The diachromatic number of digraphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Vertex critical r-dichromatic tournaments
• A conjecture of Neumann-Lara on infinite families of \(r\)-dichromatic circulant tournaments
• Circulant tournaments of prime order are tight
• The acyclic disconnection of a digraph
• The dichromatic number of a digraph
• Game colouring directed graphs
• Dichromatic number, circulant tournaments and Zykov sums of digraphs
• On a Conjecture of Víctor Neumann-Lara
• Functional iteration and the Josephus problem
• A class of tight circulant tournaments
• Infinite families of tight regular tournaments
• Digraphs
• On the oriented game chromatic number

This page was built for publication: Disproof of a conjecture of Neumann-Lara