Splitting digraphs
From MaRDI portal
Publication:3419770
DOI10.1017/S0963548306008042zbMath1116.05033OpenAlexW2912271288MaRDI QIDQ3419770
Publication date: 7 February 2007
Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1017/s0963548306008042
Extremal problems in graph theory (05C35) Directed graphs (digraphs), tournaments (05C20) Vertex degrees (05C07)
Related Items (17)
Finding good 2-partitions of digraphs. I. Hereditary properties ⋮ Majority colourings of digraphs ⋮ Finding good 2-partitions of digraphs. II. Enumerable properties ⋮ Disjoint Cycles with Length Constraints in Digraphs of Large Connectivity or Large Minimum Degree ⋮ Degree-constrained 2-partitions of graphs ⋮ Low chromatic spanning sub(di)graphs with prescribed degree or connectivity properties ⋮ Decomposing edge-colored graphs under color degree constraints ⋮ Conflict graphs and the SINR-capacity of the mean power scheme ⋮ Subdigraphs of prescribed size and out‐degree ⋮ Out-degree reducing partitions of digraphs ⋮ Partition and disjoint cycles in digraphs ⋮ Generalized Majority Colourings of Digraphs ⋮ Vertex-disjoint subtournaments of prescribed minimum outdegree or minimum semidegree: proof for tournaments of a conjecture of Stiebitz ⋮ On splitting digraphs ⋮ Majority colorings of sparse digraphs ⋮ The parameterized complexity landscape of finding 2-partitions of digraphs ⋮ Vertex coloring edge-weighted digraphs
This page was built for publication: Splitting digraphs
