Infinite digraphs with nonreconstructible outvalency sequences

DOI10.1002/JGT.3190180510MaRDI QIDQ4304257zbMATH OpenOpenAlexFDO

Authors C. St. J. A. Nash-Williams

Publication date 2 January 1995

Published in Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/jgt.3190180510

zbMATH Keywords

digraphreconstructibilityoutvalency sequence

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Recommendations

• scientific article; zbMATH DE number 1136782
• The reconstruction problem for certain infinite graphs
• scientific article; zbMATH DE number 4023320
• A property of most of the known non-reconstructible digraphs

Cited in

(1)

• Reconstructing the number of blocks of an infinite graph

This page was built for publication: Infinite digraphs with nonreconstructible outvalency sequences

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