Reconstructing Graphs

DOI10.2307/2037710zbMath0221.05076OpenAlexW4251365111MaRDI QIDQ5625218

Donald L. Greenwell

Publication date: 1971

Full work available at URL: https://doi.org/10.2307/2037710

Mathematics Subject Classification ID

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

Related Items (8)

Graphical partially ordered sets ⋮ Reconstruction of the set of branches of a graph ⋮ Reconstruction and edge reconstruction of triangle-free graphs ⋮ Edge-recognizable domination numbers. ⋮ Reconstruction of infinite graphs ⋮ On reconstructing graphs from their sets of subgraphs ⋮ Reconstructibility versus edge reconstructibility of infinite graphs ⋮ A note on the line reconstruction problem

Cites Work

• On Reconstructing a Graph
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Reconstructing Graphs