Vertex critical r-dichromatic tournaments (Q788737): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Removed claims |
||
Property / author | |||
Property / author: Víctor Neumann-Lara / rank | |||
Property / author | |||
Property / author: Jorge Urrutia / rank | |||
Property / reviewed by | |||
Property / reviewed by: John W. Moon / rank | |||
Revision as of 10:11, 10 February 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Vertex critical r-dichromatic tournaments |
scientific article |
Statements
Vertex critical r-dichromatic tournaments (English)
0 references
1984
0 references
The dichromatic number d(D) of a directed graph D is the smallest number of colours needed to colour the vertices of D in such a way that D contains no monochromatic directed cycle. If \(d(D)=r\) but \(d(D-v)=r-1\) for every vertex v of D, then D is a critical r-dichromatic digraph. The authors construct an infinite family of critical r-dichromatic regular tournaments for every r such that \(r=3\) or \(r\geq 5\).
0 references
critical tournaments
0 references
dichromatic number
0 references
monochromatic directed cycle
0 references