On the reconstruction of planar graphs
From MaRDI portal
Publication:2642012
DOI10.1016/J.JCTB.2006.12.005zbMATH Open1121.05076OpenAlexW2022696176MaRDI QIDQ2642012FDOQ2642012
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
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Graph reconstruction—a survey
- A congruence theorem for trees
- How to Draw a Graph
- The reconstruction of maximal planar graphs. II: Reconstruction
- Fastplättbare Graphen
- The reconstruction of maximal planar graphs. I: Recognition
- A THEOREM ON PLANAR GRAPHS WITH AN APPLICATION TO THE RECONSTRUCTION PROBLEM, I
Cited In (5)
- An algebraic formulation of the graph reconstruction conjecture
- Edge-reconstruction of minimally 3-connected planar graphs
- Reconstructing the degree sequence of a sparse graph from a partial deck
- Efficient reassembling of three-regular planar graphs
- The reconstruction conjecture for finite simple graphs and associated directed graphs
Recommendations
- On Reconstructing Graphs and Their Complements 👍 👎
- On reconstruction of graphs 👍 👎
- On the complexity of graph reconstruction 👍 👎
- On the reconstruction of graph invariants 👍 👎
- Title not available (Why is that?) 👍 👎
- Title not available (Why is that?) 👍 👎
- Title not available (Why is that?) 👍 👎
- Title not available (Why is that?) 👍 👎
- Title not available (Why is that?) 👍 👎
- Title not available (Why is that?) 👍 👎
This page was built for publication: On the reconstruction of planar graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2642012)