Vertex critical r-dichromatic tournaments

DOI10.1016/0012-365X(84)90154-7zbMath0532.05031MaRDI QIDQ788737

Víctor Neumann-Lara, Jorge Urrutia

Publication date: 1984

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

zbMATH Keywords

dichromatic numbercritical tournamentsmonochromatic directed cycle

Mathematics Subject Classification ID

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

Related Items (12)

Extendiendo un resultado de coloraciones de gráficas a coloraciones de digráficas ⋮ Uniquely colourable m-dichromatic oriented graphs ⋮ The 3 and 4-dichromatic tournaments of minimum order ⋮ Vertex critical 4-dichromatic circulant tournaments ⋮ Disproof of a conjecture of Neumann-Lara ⋮ The dichromatic number of infinite families of circulant tournaments ⋮ A conjecture of Neumann-Lara on infinite families of \(r\)-dichromatic circulant tournaments ⋮ Convex circuit-free coloration of an oriented graph ⋮ The acyclic disconnection of a digraph ⋮ Some of My Favorite Coloring Problems for Graphs and Digraphs ⋮ Tournaments without acyclic interval. ⋮ Infinite families of -dichromatic vertex critical circulant tournaments

Cites Work

• On the decomposition of a minimally strongly h-connected digraph into h+1 acircuitic subgraphs
• Unnamed Item
• Unnamed Item

This page was built for publication: Vertex critical r-dichromatic tournaments