Dichromatic number, circulant tournaments and Zykov sums of digraphs

DOI10.7151/dmgt.1119zbMath0984.05043OpenAlexW1967850243MaRDI QIDQ2725183

Víctor Neumann-Lara

Publication date: 24 March 2002

Published in: Discussiones Mathematicae Graph Theory (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/6c445afc073705ca36b015f4644879c16a25c326

zbMATH Keywords

digraphdichromatic numberZykov sumcirculant tournaments

Mathematics Subject Classification ID

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

Related Items (10)

Extendiendo un resultado de coloraciones de gráficas a coloraciones de digráficas ⋮ The digrundy number of digraphs ⋮ Disproof of a conjecture of Neumann-Lara ⋮ The smallest 5-chromatic tournament ⋮ On a Conjecture of Víctor Neumann-Lara ⋮ On the acyclic disconnection of multipartite tournaments ⋮ The dichromatic number of infinite families of circulant tournaments ⋮ A conjecture of Neumann-Lara on infinite families of \(r\)-dichromatic circulant tournaments ⋮ The diachromatic number of digraphs ⋮ Infinite families of -dichromatic vertex critical circulant tournaments

This page was built for publication: Dichromatic number, circulant tournaments and Zykov sums of digraphs