Out‐colourings of digraphs

DOI10.1002/jgt.22476zbMath1495.05080arXiv1706.06441OpenAlexW2964126400WikidataQ127448584 ScholiaQ127448584MaRDI QIDQ5110646

Noga Alon, Stéphane Bessy, Jörgen Bang-Jensen

Publication date: 21 May 2020

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1706.06441

zbMATH Keywords

tournamentspolynomial algorithmprobabilistic methodPaley tournamentsemicomplete digraphsdegree constrained partitioning of digraphsout-colourings

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Directed graphs (digraphs), tournaments (05C20) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40)

Related Items (4)

Subdigraphs of prescribed size and out‐degree ⋮ Classes of intersection digraphs with good algorithmic properties ⋮ Majority colorings of sparse digraphs ⋮ Tournaments and Semicomplete Digraphs

This page was built for publication: Out‐colourings of digraphs