Majority colourings of digraphs (Q2628255)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Majority colourings of digraphs |
scientific article |
Statements
Majority colourings of digraphs (English)
0 references
13 June 2017
0 references
Summary: We prove that every digraph has a vertex 4-colouring such that for each vertex \(v\), at most half the out-neighbours of \(v\) receive the same colour as \(v\). We then obtain several results related to the conjecture obtained by replacing 4 by 3.
0 references
graph theory
0 references
digraphs
0 references
graph colouring
0 references
majority colouring
0 references
