DC Field | Value | Language |
---|---|---|
dc.contributor.author | Kreutzer, S | ko |
dc.contributor.author | Oum, SI | ko |
dc.contributor.author | Seymour, P | ko |
dc.contributor.author | van der Zypen, D | ko |
dc.contributor.author | Wood, DR | ko |
dc.date.accessioned | 2017-08-08T06:53:46Z | - |
dc.date.available | 2017-08-08T06:53:46Z | - |
dc.date.created | 2017-06-14 | - |
dc.date.created | 2017-06-14 | - |
dc.date.created | 2017-06-14 | - |
dc.date.issued | 2017-05 | - |
dc.identifier.citation | ELECTRONIC JOURNAL OF COMBINATORICS, v.24, no.2 | - |
dc.identifier.issn | 1077-8926 | - |
dc.identifier.uri | http://hdl.handle.net/10203/225256 | - |
dc.description.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. | - |
dc.language | English | - |
dc.publisher | ELECTRONIC JOURNAL OF COMBINATORICS | - |
dc.title | Majority colourings of digraphs | - |
dc.type | Article | - |
dc.identifier.wosid | 000408644900003 | - |
dc.identifier.scopusid | 2-s2.0-85019963268 | - |
dc.type.rims | ART | - |
dc.citation.volume | 24 | - |
dc.citation.issue | 2 | - |
dc.citation.publicationname | ELECTRONIC JOURNAL OF COMBINATORICS | - |
dc.contributor.localauthor | Oum, SI | - |
dc.contributor.nonIdAuthor | Kreutzer, S | - |
dc.contributor.nonIdAuthor | Seymour, P | - |
dc.contributor.nonIdAuthor | van der Zypen, D | - |
dc.contributor.nonIdAuthor | Wood, DR | - |
dc.description.isOpenAccess | N | - |
dc.type.journalArticle | Article | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.