Vertex critical 4-dichromatic circulant tournaments

DOI10.1016/S0012-365X(96)00128-8zbMATH Open0876.05039MaRDI QIDQ1363679FDOQ1363679

Authors: V. Neumann-Lara 

Publication date: 10 August 1997

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

zbMATH Keywords

dichromatic numbervertex critical 4-dichromatic circulant tournaments

Mathematics Subject Classification ID

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

Cites Work

• The dichromatic number of a digraph
• Title not available (Why is that?)
• The 3 and 4-dichromatic tournaments of minimum order
• Vertex critical r-dichromatic tournaments
• Disproof of a conjecture of Erdös and moser on tournaments

Cited In (7)

• Infinite families of -dichromatic vertex critical circulant tournaments
• The acyclic disconnection of a digraph
• Extendiendo un resultado de coloraciones de gráficas a coloraciones de digráficas
• Tournaments and Semicomplete Digraphs
• On an adjacency property of almost all tournaments
• The dichromatic number of infinite families of circulant tournaments
• A conjecture of Neumann-Lara on infinite families of \(r\)-dichromatic circulant tournaments

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1363679)