The 3 and 4-dichromatic tournaments of minimum order

DOI10.1016/0012-365X(93)E0113-IzbMath0829.05028MaRDI QIDQ1343264

Víctor Neumann-Lara

Publication date: 1 February 1995

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

zbMATH Keywords

digraphisomorphismtournamentdichromatic numberminimum order

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Directed graphs (digraphs), tournaments (05C20) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items (14)

On the dichromatic number of surfaces ⋮ The dichromatic polynomial of a digraph ⋮ A short proof of a theorem of Reid and Parker on tournaments ⋮ Vertex critical 4-dichromatic circulant tournaments ⋮ The minimum number of edges in 4-critical digraphs of given order ⋮ The smallest 5-chromatic tournament ⋮ DICHROMATIC NUMBER AND FRACTIONAL CHROMATIC NUMBER ⋮ The dichromatic number of infinite families of circulant tournaments ⋮ The edge density of critical digraphs ⋮ A conjecture of Neumann-Lara on infinite families of \(r\)-dichromatic circulant tournaments ⋮ The chromatic polynomial of a digraph ⋮ Hajós and Ore constructions for digraphs ⋮ The acyclic disconnection of a digraph ⋮ Infinite families of -dichromatic vertex critical circulant tournaments

Cites Work

• Vertex critical r-dichromatic tournaments
• The dichromatic number of a digraph
• Disproof of a conjecture of Erdös and moser on tournaments
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The 3 and 4-dichromatic tournaments of minimum order