scientific article; zbMATH DE number 4023320

zbMATH Open0629.05039MaRDI QIDQ3765804FDOQ3765804

Authors: William Kocay 

Publication date: 1984

Title of this publication is not available (Why is that?)

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

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)

Cited In (7)

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

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)