scientific article; zbMATH DE number 970793

MaRDI QIDQ5688997zbMATH OpenFDO

Authors Martin Aigner, Eberhard Triesch

Publication date 11 March 1997

zbMATH Keywords

degree sequencesdirected graphneighborhood listsrealization problemsreconstruction problems

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Recommendations

• Dag realizations of directed degree sequences
• scientific article; zbMATH DE number 1827734
• Realizability and uniqueness in graphs
• A simple Havel-Hakimi type algorithm to realize graphical degree sequences of directed graphs

Cited in

(18)

• Combinatorial reconstruction problems
• On degree sequences of undirected, directed, and bidirected graphs
• Degree complete graphs
• Neighborhood degree lists of graphs
• Constructing bounded degree graphs with prescribed degree and neighbor degree sequences
• Degree sequences of multigraphs
• Dag realizations of directed degree sequences
• Reconstructing Digraphs from Partial Dadecks
• A note on the characterization of digraphic sequences
• scientific article; zbMATH DE number 25611 (Why is no real title available?)
• Realization of Matrices and Directed Graphs
• Reconstructing a Graph from its Neighborhood Lists
• scientific article; zbMATH DE number 1827734 (Why is no real title available?)
• Realization problems on reachability sequences
• Realization problems on reachability sequences
• Graph realizations: maximum degree in vertex neighborhoods
• Neighborhood hypergraphs of digraphs and some matrix permutation problems
• A simple Havel-Hakimi type algorithm to realize graphical degree sequences of directed graphs

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5688997)