Reconstructing the degree pair sequence of a digraph
From MaRDI portal
Publication:2555081
DOI10.1016/0095-8956(73)90028-2zbMath0245.05108MaRDI QIDQ2555081
Publication date: 1973
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0095-8956(73)90028-2
05C20: Directed graphs (digraphs), tournaments
Related Items
A property of most of the known non-reconstructible digraphs, Reconstructing degree sequences from k-vertex-deleted subgraphs, A census of non-reconstructable digraphs. I: Six related families, Reconstruction of infinite graphs, What is reconstruction for ordered sets?, Determining connectedness from subdigraphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A congruence theorem for trees
- On the problem of reconstructing a tournament from subtournaments
- On Ulam's conjecture for separable graphs
- The Reconstruction of a Tree from its Maximal Subtrees
- On Reconstructing a Graph
- On reconstruction of graphs
- Reconstruction of Cacti
- Reconstruction of Trees
- On nonreconstructable tournaments