Split digraphs
From MaRDI portal
Publication:764900
DOI10.1016/j.disc.2011.12.023zbMath1241.05116arXiv1005.2452OpenAlexW2912133305MaRDI QIDQ764900
Publication date: 16 March 2012
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1005.2452
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Directed graphs (digraphs), tournaments (05C20) Vertex degrees (05C07)
Related Items (6)
Results on the small quasi-kernel conjecture ⋮ Comparability digraphs: an analogue of comparability graphs ⋮ New Classes of Degree Sequences with Fast Mixing Swap Markov Chain Sampling ⋮ Strict chordal and strict split digraphs ⋮ Recognition of split-graphic sequences ⋮ Oriented Threshold Graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Zero-one matrices with zero trace
- The strong perfect graph theorem
- A simple Havel-Hakimi type algorithm to realize graphical degree sequences of directed graphs
- The strong perfect graph conjecture: 40 years of attempts, and its resolution
- The splittance of a graph
- Decomposition of graphical sequences and unigraphs
- Split graphs
- Threshold graphs and related topics
- Algorithms for constructing graphs and digraphs with given valences and factors
- Uniform Sampling of Digraphs with a Fixed Degree Sequence
- List Partitions
This page was built for publication: Split digraphs