Dag realizations of directed degree sequences
From MaRDI portal
Recommendations
Cites work
- A remark on the existence of finite graphs
- A theorem on flows in networks
- Algorithms for constructing graphs and digraphs with given valences and factors
- Combinatorial Properties of Matrices of Zeros and Ones
- Dag realizations of directed degree sequences
- Graph factors
- On Realizability of a Set of Integers as Degrees of the Vertices of a Linear Graph. I
- On the realization of a (p,s)-digraph with prescribed degrees
- The k-factor conjecture is true
- Zero-one matrices with zero trace
Cited in
(9)- Generating two-terminal directed acyclic graphs with a given complexity index by constraint logic programming
- Characterization of digraphic sequences with strongly connected realizations
- Dag realizations of directed degree sequences
- A note on the characterization of digraphic sequences
- scientific article; zbMATH DE number 1827734 (Why is no real title available?)
- scientific article; zbMATH DE number 970793 (Why is no real title available?)
- Realization problems on reachability sequences
- Realization problems on reachability sequences
- A simple Havel-Hakimi type algorithm to realize graphical degree sequences of directed graphs
This page was built for publication: Dag realizations of directed degree sequences
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3088289)