Dag Realizations of Directed Degree Sequences
From MaRDI portal
Publication:3088289
DOI10.1007/978-3-642-22953-4_23zbMath1342.68151DBLPconf/fct/BergerM11OpenAlexW2275834703WikidataQ57013169 ScholiaQ57013169MaRDI QIDQ3088289
Annabell Berger, Matthias Müller-Hannemann
Publication date: 19 August 2011
Published in: Fundamentals of Computation Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-22953-4_23
Analysis of algorithms and problem complexity (68Q25) Graph algorithms (graph-theoretic aspects) (05C85) Directed graphs (digraphs), tournaments (05C20) Vertex degrees (05C07)
Related Items (3)
NP-Hardness and Fixed-Parameter Tractability of Realizing Degree Sequences with Directed Acyclic Graphs ⋮ Realization problems on reachability sequences ⋮ Dag Realizations of Directed Degree Sequences
Cites Work
- A theorem on flows in networks
- Zero-one matrices with zero trace
- Graph factors
- On the realization of a (p,s)-digraph with prescribed degrees
- The k-factor conjecture is true
- Algorithms for constructing graphs and digraphs with given valences and factors
- Dag Realizations of Directed Degree Sequences
- A remark on the existence of finite graphs
- Combinatorial Properties of Matrices of Zeros and Ones
- On Realizability of a Set of Integers as Degrees of the Vertices of a Linear Graph. I
This page was built for publication: Dag Realizations of Directed Degree Sequences