On the problem of reconstructing a tournament from subtournaments

DOI10.1007/BF01299955zbMath0148.43601OpenAlexW1965620457MaRDI QIDQ2524984

Frank Harary, Edgar M. Palmer

Publication date: 1967

Published in: Monatshefte für Mathematik (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/177362

zbMATH Keywords

topology

Related Items

Vertex ordering and partitioning problems for random spatial graphs. ⋮ The \(\{-2,-1\}\)-selfdual and decomposable tournaments ⋮ Are all pairs of hypomorphic digraphs \(S\)-isomorphic? ⋮ A larger class of reconstructible tournaments ⋮ A census of non-reconstructable digraphs. I: Six related families ⋮ Reconstruction of small graphs and digraphs ⋮ The half-isomorphy and the finite strongly connected tournaments ⋮ Strongly self-complementary and hereditarily isomorphic tournaments ⋮ On reconstructing graphs from their sets of subgraphs ⋮ Realization problems on reachability sequences ⋮ Reconstruction of maximal outerplanar graphs ⋮ Reconstructing the degree pair sequence of a digraph ⋮ Determining connectedness from subdigraphs

Cites Work

• Unnamed Item
• A congruence theorem for trees
• Reguläre Graphen beliebigen Grades mit vorgegebenen Eigenschaften
• The Maximum Number of Strongly Connected Subtournaments^*
• The theory of tournaments: A miniature mathematical system
• The Theory of Round Robin Tournaments