Vertex critical 4-dichromatic circulant tournaments

An infinite family of vertex critical 4-dichromatic circulant tournaments is presented, answering a problem posed by Neumann-Lara and Urrutia (1984).

• Publication year

  1997

• Venue

  Discrete Mathematics

• Publication date

  1997-06-10

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1016/S0012-365X(96)00128-8
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• The 3 and 4-dichromatic tournaments of minimum order

  1994cited by this paper
• Vertex critical r-dichromatic tournaments

  1984cited by this paper
• The dichromatic number of a digraph

  1982cited by this paper
• Disproof of a conjecture of Erdös and moser on tournaments

  1970cited by this paper
• Problems and Results in Number Theory and Graph Theory

  year unknowncited by this paper

• The 3-Dicritical Semi-Complete Digraphs

  2024cites this paper
• Tournaments and Semicomplete Digraphs

  2018cites this paper
• The Dichromatic Number of Infinite Families of Circulant Tournaments

  2017cites this paper
• 1930 THE DICHROMATIC NUMBER OF INFINITE FAMILIES OF CIRCULANT TOURNAMENTS Nahid

  2016cites this paper
• Brooks-type results for coloring of digraphs

  2011cites this paper
• A conjecture of Neumann-Lara on infinite families of r-dichromatic circulant tournaments

  2010influential citation
• Digraph Coloring Games and Game-Perfectness

  2007cites this paper
• Infinite families of (n+1)-dichromatic vertex critical circulant tournaments

  2007influential citation
• On an adjacency property of almost all tournaments

  2006cites this paper
• Dichromatic number, circulant tournaments and Zykov sums of digraphs

  2000cites this paper
• The acyclic disconnection of a digraph

  1999cites this paper