To refer to this page use:
|Abstract:||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.|
|Electronic Publication Date:||19-May-2017|
|Citation:||Kreutzer, Stephan, Oum, Sang-il, Seymour, Paul, van der Zypen, Dominic, Wood, David R. (2017). Majority Colourings of Digraphs. ELECTRONIC JOURNAL OF COMBINATORICS, 24|
|Type of Material:||Journal Article|
|Journal/Proceeding Title:||ELECTRONIC JOURNAL OF COMBINATORICS|
|Version:||Final published version. This is an open access article.|
Items in OAR@Princeton are protected by copyright, with all rights reserved, unless otherwise indicated.