A survey on edge reconstruction of graphs
From MaRDI portal
Publication:4792930
DOI10.1080/09720529.2002.10697932zbMath1030.05081OpenAlexW2322770184MaRDI QIDQ4792930
Vilma Viazzi, Alicia MacCari, Olga Rueda
Publication date: 22 February 2004
Published in: Journal of Discrete Mathematical Sciences and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/09720529.2002.10697932
Related Items (2)
Degree lists and connectedness are 3-reconstructible for graphs with at least seven vertices ⋮ Degree-associated reconstruction number of graphs
Cites Work
- A congruence theorem for trees
- Some applications of the Nash-Williams lemma to the edge-reconstruction conjecture
- On the edge reconstruction of locally finite disconnected graphs with a finite number of components
- Balance equations for reconstruction problems
- Reconstructing graphs from their k-edge deleted subgraphs
- Combinatorial reconstruction problems
- A note on the edge-reconstruction of \(K_{1,m}\)-free graphs
- Simpler counterexamples to the edge-reconstruction conjecture for infinite graphs
- Reconstruction of infinite graphs
- Disproof of a conjecture in graph reconstruction theory
- Reconstructibility versus edge reconstructibility of infinite graphs
- Counterexamples to the Edge Reconstruction Conjecture for infinite graphs
- On the edge reconstruction of graphs embedded on surfaces
- Some results and approaches for reconstruction conjectures
- Edge-reconstruction of minimally 3-connected planar graphs
- On the Nash-Williams' lemma in graph reconstruction theory
- On the edge-reconstruction of 3-connected planar graphs with minimum valency 4
- On a reconstruction problem
- A note on the line reconstruction problem
- Reconstructing the n-connected components of a graph
- The edge reconstruction of hamiltonian graphs
- Claw‐free graphs are edge reconstructible
- Bidegreed graphs are edge reconstructible
- Edge‐reconstruction of planar graphs with minimum valency 5
- Edge-reconstruction of 4-connected planar graphs
- ON THE EDGE-RECONSTRUCTION OF GRAPHS WHICH TRIANGULATE SURFACES
- The Edge Reconstructibility of Planar Bidegree Graphs
- Graph reconstruction—a survey
- On the edge-reconstruction of planar graphs
- A note on the edge reconstruction conjecture
- Trees in Polyhedral Graphs
- Reconstruction of Trees
- On the edge-reconstruction of graphs
This page was built for publication: A survey on edge reconstruction of graphs
