Size reconstructibility of graphs

DOI10.1002/jgt.22616zbMath1521.05122OpenAlexW3047126910MaRDI QIDQ6055396

Alexander D. Scott, Hannah Guggiari, Carla Groenland

Publication date: 29 September 2023

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

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

zbMATH Keywords

vertex-deleted subgraphsgraph reconstructionpartial deckcommon cardssize reconstruction

Mathematics Subject Classification ID

Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items (1)

Reconstructing the degree sequence of a sparse graph from a partial deck

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A congruence theorem for trees
• The degree sequence is reconstructible from \(n-1\) cards
• The size of a graph is reconstructible from any \(n-2\) cards
• Towards size reconstruction from fewer cards
• Topics in Graph Automorphisms and Reconstruction
• Almost every graph has reconstruction number three
• Families of pairs of graphs with a large number of common cards
• Graph reconstruction—a survey
• Recognizing connectedness from vertex-deleted subgraphs

This page was built for publication: Size reconstructibility of graphs