scientific article; zbMATH DE number 4023320

MaRDI QIDQ3765804zbMATH OpenFDO

Authors William Kocay

Publication date 1984

zbMATH Keywords

tournamentsconstructionnon-reconstructible digraphs

Mathematics Subject Classification ID

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

Recommendations

• On Stockmeyer's non-reconstructible tournaments
• A property of most of the known non-reconstructible digraphs
• scientific article; zbMATH DE number 817353
• Reconstructing Digraphs from Partial Dadecks
• All digraphs are N-reconstructible if all digraphs with 2-connected underlying graphs are N-reconstructible

Cited in

(7)

• A family of non-reconstructible hypergraphs
• Non-recursively constructible recursive families of graphs
• On digraph reconstruction
• More non-reconstructible hypergraphs
• On the non-existence of families of \((d,k, \delta)\)-digraphs containing only selfrepeat vertices
• A property of most of the known non-reconstructible digraphs
• On Stockmeyer's non-reconstructible tournaments

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 Q3765804)