Reconstruction of small graphs and digraphs

zbMath1493.05212arXiv2102.01942MaRDI QIDQ5090542

Brendan D. McKay

Publication date: 20 July 2022

Full work available at URL: https://arxiv.org/abs/2102.01942

zbMATH Keywords

graph reconstruction conjecture

Mathematics Subject Classification ID

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

Related Items (1)

Vertex-substitution framework verifies the reconstruction conjecture for finite undirected graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Posets on up to 16 points
• A census of non-reconstructable digraphs. I: Six related families
• On reconstructing graphs from their sets of subgraphs
• What is reconstruction for ordered sets?
• Practical graph isomorphism. II.
• On the problem of reconstructing a tournament from subtournaments
• On Stockmeyer's non-reconstructible tournaments
• The falsity of the reconstruction conjecture for tournaments
• Computer reconstruction of small graphs
• Isomorph-Free Exhaustive Generation
• Generating the Nine-Point Graphs
• On reconstruction of graphs
• On nonreconstructable tournaments

This page was built for publication: Reconstruction of small graphs and digraphs