Some results and approaches for reconstruction conjectures

DOI10.1016/0012-365X(92)00061-UzbMath0789.05072OpenAlexW1970168621WikidataQ123147479 ScholiaQ123147479MaRDI QIDQ1313839

Bhalchandra D. Thatte

Publication date: 1 March 1994

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

Full work available at URL: https://doi.org/10.1016/0012-365x(92)00061-u

zbMATH Keywords

chordal graphsreconstruction conjectureNash-Williams' theoremclaw-freemaximal outerplanar graphsshuffled edge deck\(P_ 4\)-free

Mathematics Subject Classification ID

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

Related Items (2)

A survey on edge reconstruction of graphs ⋮ On a reconstruction problem

Cites Work

• Unnamed Item
• Unnamed Item
• Reconstructing graphs from their k-edge deleted subgraphs
• On a new digraph reconstruction conjecture
• On the Nash-Williams' lemma in graph reconstruction theory
• The falsity of the reconstruction conjecture for tournaments
• Graph reconstruction—a survey

This page was built for publication: Some results and approaches for reconstruction conjectures