Majority colourings of digraphs

Cited 12 time in webofscience Cited 0 time in scopus
  • Hit : 500
  • Download : 0
DC FieldValueLanguage
dc.contributor.authorKreutzer, Sko
dc.contributor.authorOum, SIko
dc.contributor.authorSeymour, Pko
dc.contributor.authorvan der Zypen, Dko
dc.contributor.authorWood, DRko
dc.date.accessioned2017-08-08T06:53:46Z-
dc.date.available2017-08-08T06:53:46Z-
dc.date.created2017-06-14-
dc.date.created2017-06-14-
dc.date.created2017-06-14-
dc.date.issued2017-05-
dc.identifier.citationELECTRONIC JOURNAL OF COMBINATORICS, v.24, no.2-
dc.identifier.issn1077-8926-
dc.identifier.urihttp://hdl.handle.net/10203/225256-
dc.description.abstractWe 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.languageEnglish-
dc.publisherELECTRONIC JOURNAL OF COMBINATORICS-
dc.titleMajority colourings of digraphs-
dc.typeArticle-
dc.identifier.wosid000408644900003-
dc.identifier.scopusid2-s2.0-85019963268-
dc.type.rimsART-
dc.citation.volume24-
dc.citation.issue2-
dc.citation.publicationnameELECTRONIC JOURNAL OF COMBINATORICS-
dc.contributor.localauthorOum, SI-
dc.contributor.nonIdAuthorKreutzer, S-
dc.contributor.nonIdAuthorSeymour, P-
dc.contributor.nonIdAuthorvan der Zypen, D-
dc.contributor.nonIdAuthorWood, DR-
dc.description.isOpenAccessN-
dc.type.journalArticleArticle-
Appears in Collection
MA-Journal Papers(저널논문)
Files in This Item
There are no files associated with this item.
This item is cited by other documents in WoS
⊙ Detail Information in WoSⓡ Click to see webofscience_button
⊙ Cited 12 items in WoS Click to see citing articles in records_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0