On the reconstruction of planar graphs

DOI10.1016/j.jctb.2006.12.005zbMath1121.05076OpenAlexW2022696176MaRDI QIDQ2642012

Mark Bilinski, Young Soo Kwon, Xingxing Yu

Publication date: 20 August 2007

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jctb.2006.12.005

zbMATH Keywords

recognitionreconstructionplanar graphnon-separating cyclewheel neighborhood

Mathematics Subject Classification ID

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

Related Items (3)

The reconstruction conjecture for finite simple graphs and associated directed graphs ⋮ Reconstructing the degree sequence of a sparse graph from a partial deck ⋮ An Algebraic Formulation of the Graph Reconstruction Conjecture

Cites Work

• A congruence theorem for trees
• The reconstruction of maximal planar graphs. I: Recognition
• The reconstruction of maximal planar graphs. II: Reconstruction
• Graph reconstruction—a survey
• A THEOREM ON PLANAR GRAPHS WITH AN APPLICATION TO THE RECONSTRUCTION PROBLEM, I
• Fastplättbare Graphen
• How to Draw a Graph
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On the reconstruction of planar graphs