Reconstructing graphs from size and degree properties of their induced \(k\)-subgraphs

DOI10.1016/j.disc.2006.06.031zbMath1119.05071OpenAlexW1978471807MaRDI QIDQ868330

Dieter Rautenbach, Yair Caro

Publication date: 2 March 2007

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2006.06.031

zbMATH Keywords

degreeregular graphinduced subgraphgraph reconstruction

Mathematics Subject Classification ID

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

Cites Work

• A congruence theorem for trees
• Recognizing global occurrence of local properties
• The uniformity space of hypergraphs and its applications
• Realizability and uniqueness in graphs
• A Class of Graphs
• On graphs with prescribed subgraphs of order $k$, and a theorem of Kelly and Merriell
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Reconstructing graphs from size and degree properties of their induced \(k\)-subgraphs