Cites work
- A congruence theorem for asymmetric trees
- A congruence theorem for trees
- scientific article; zbMATH DE number 3298617 (Why is no real title available?)
- scientific article; zbMATH DE number 3301261 (Why is no real title available?)
- On a conjecture concerning the reconstruction of graphs
- ON RECONSTRUCTING DISCONNECTED GRAPHS
- On some mappings related to graphs
- On the Minimum Order of Graphs with Given Group
- On the Structure of Finite T0 + T5 Spaces
- On Ulam's conjecture for separable graphs
- Quelques problèmes combinatoires concernant les ordres totaux et les rélations monomorphes
- Reconstructing colored graphs
- Reconstructing infinite graphs
- Reconstructing trees from two point deleted subtrees
- Reconstruction of Cacti
- Reconstruction of Trees
- The Reconstruction of a Tree from its Maximal Subtrees
- Unicyclic Graphs Satisfy Harary′s Conjecture
Cited in
(only showing first 100 items - show all)- Quotients of Peck posets
- Reconstruction from vertex-switching
- A family of non-reconstructible hypergraphs
- On the edge reconstruction of locally finite disconnected graphs with a finite number of components
- Reconstructing graphs from their k-edge deleted subgraphs
- Hypomorphisms, orbits, and reconstruction
- Mathematical problems and games
- A semi-strong perfect graph theorem
- Reconstruction of k-orbits of a permutation group
- A census of non-reconstructable digraphs. I: Six related families
- Sur certains tournois reconstructibles application à leurs groupes d'automorphismes
- Reconstructing the degree sequence and the number of components of an infinite graph
- Intersection theory for graphs
- On the combinatorial problems which I would most like to see solved
- Simpler counterexamples to the edge-reconstruction conjecture for infinite graphs
- Proof of Harary's conjecture on the reconstruction of trees
- La reconstruction au sens de Ulam de certaines multirelations binaires. (The reconstruction in Ulam's sense of some binary multirelations)
- Reconstruction of sequences
- Two metrics in a graph theory modeling of organic chemistry
- Reconstruction of infinite graphs
- The degree sequence is reconstructible from \(n-1\) cards
- Reconstructing graphs as subsumed graphs of hypergraphs, and some self- complementary triple systems
- The reconstruction of multirelations, at least one component of which is a chain
- The k-orbit reconstruction and the orbit algebra
- Note sur le problème de Ulam
- Reconstructibility versus edge reconstructibility of infinite graphs
- A test for legitimate decks
- The reconstruction of maximal planar graphs. I: Recognition
- The reconstruction of maximal planar graphs. II: Reconstruction
- Reconstructing subsets of \(\mathbb{Z}_n\)
- A reconstruction problem related to balance equations. II: The general case
- 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 edge-reconstruction of 3-connected planar graphs with minimum valency 4
- On a reconstruction problem
- Width two posets are reconstructible
- Techniques in matroid reconstruction
- A bibliography on chromatic polynomials
- A reconstruction problem related to balance equations
- The centroidal branches of a separable graph are edge reconstructible
- Reconstruction of finite truncated semi-modular lattices
- Some work towards the proof of the reconstruction conjecture
- Reconstruction of the path graph
- Reconstruction of distance hereditary 2-connected graphs
- The \(\{-2,-1\}\)-selfdual and decomposable tournaments
- The \((\leq 5)\)-hypomorphy of digraphs up to complementation
- \((-1)\)-hypomorphic graphs with the same 3-element homogeneous subsets
- The combinatorial \(k\)-deck
- What is reconstruction for ordered sets?
- Non-reconstructible locally finite graphs
- Towards the reconstruction of posets
- Token graphs
- Finite orders which are reconstructible up to duality by their comparability graphs
- Graphs and their associated inverse semigroups
- Equality of graphs up to complementation
- The robustness of LWPP and WPP, with an application to graph reconstruction
- The reconstruction conjecture for finite simple graphs and associated directed graphs
- The idiosyncratic polynomial of digraphs
- Are all pairs of hypomorphic digraphs S-isomorphic?
- Reconstructing the degree sequence of a sparse graph from a partial deck
- Degree lists and connectedness are 3-reconstructible for graphs with at least seven vertices
- Hereditary isomorphy and \(\{-4\}\)-hypomorphy for tournaments
- Distance hereditary graphs \(G\) of connectivity two or three and \(\operatorname{diam} (G) = \operatorname{diam} (\overline{G}) = 3\) are reconstructible
- Some Kähler structures on products of 2-spheres
- Not all phylogenetic networks are leaf-reconstructible
- Indecomposability graph and indecomposability recognition
- A reduction of the graph reconstruction conjecture
- Towards size reconstruction from fewer cards
- Hypomorphy of graphs up to complementation
- Reconstructing the number of blocks of an infinite graph
- On the reconstruction of planar graphs
- Reconstruction of the geometric structure of a set of points in the plane from its geometric tree graph
- On the reconstruction of graph invariants
- The Dirichlet boundary value problems for p-Schrödinger operators on finite networks
- Discrete phase retrieval in musical structures
- Some Ulam's reconstruction problems for quantum states
- ON α,β DESTRUCTIBLE GRAPHS
- Description of the tournaments which are reconstructible from their \(k\)-cycle partial digraphs for \(k\in \{3, 4\}\)
- A note on non-reconstructible 3-hypergraphs
- Operator Decomposition of Graphs and the Reconstruction Conjecture
- Families of pairs of graphs with a large number of common cards
- \(\{-1\}\)-self dual finite prechains and applications
- scientific article; zbMATH DE number 3790472 (Why is no real title available?)
- The \((\leq 6)\)-half-reconstructibility of digraphs
- Reconstructible and Half-Reconstructible Tournaments: Application to Their Groups of Hemimorphisms
- On the complexity of graph reconstruction
- The pairs of \(\{-3\}\)-hypomorphic tournaments
- Leaf-reconstructibility of phylogenetic networks
- Ordered sets that are reconstructible from two cards and the number of comparabilities.
- scientific article; zbMATH DE number 6963897 (Why is no real title available?)
- A survey on edge reconstruction of graphs
- Description of the orders which are hereditarily half-reconstructible by their comparability graphs
- Reconstruction of 2-connected parity graphs
- The robustness of LWPP and WPP, with an application to graph reconstruction
- Graph kernels: a survey
- A property of most of the known non-reconstructible digraphs
- Reconstructing trees from two cards
- Recognizing connectedness from vertex-deleted subgraphs
- Degree associated reconstruction number of certain connected graphs with unique end vertex and a vertex of degree \(n-2\)
This page was built for publication: Graph reconstruction—a survey
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4154892)
