Majority colourings of digraphs (Q2628255)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6729618
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Majority colourings of digraphs |
scientific article; zbMATH DE number 6729618 |
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
0.94222474
0 references
0 references
0.89904314
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
