Graph reconstruction—a survey
From MaRDI portal
Publication:4154892
Cites work
- scientific article; zbMATH DE number 3298617 (Why is no real title available?)
- scientific article; zbMATH DE number 3301261 (Why is no real title available?)
- A congruence theorem for asymmetric trees
- A congruence theorem for trees
- ON RECONSTRUCTING DISCONNECTED GRAPHS
- On Ulam's conjecture for separable graphs
- On a conjecture concerning the reconstruction of graphs
- On some mappings related to graphs
- On the Minimum Order of Graphs with Given Group
- On the Structure of Finite T0 + T5 Spaces
- 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)- On the reconstruction of planar graphs
- Some Kähler structures on products of 2-spheres
- Reconstruction of distance hereditary 2-connected graphs
- Decks of rooted binary trees
- scientific article; zbMATH DE number 6963897 (Why is no real title available?)
- Degree associated reconstruction number of certain connected graphs with unique end vertex and a vertex of degree \(n-2\)
- Vertex-substitution framework verifies the reconstruction conjecture for finite undirected graphs
- Reconstruction of finite truncated semi-modular lattices
- Reconstructibility versus edge reconstructibility of infinite graphs
- Description of the orders which are hereditarily half-reconstructible by their comparability graphs
- Are all pairs of hypomorphic digraphs \(S\)-isomorphic?
- Reconstruction and edge reconstruction of triangle-free graphs
- A reconstruction problem related to balance equations
- A test for legitimate decks
- The reconstruction of maximal planar graphs. I: Recognition
- The centroidal branches of a separable graph are edge reconstructible
- Non-reconstructible locally finite graphs
- Recognizing connectedness from vertex-deleted subgraphs
- The robustness of LWPP and WPP, with an application to graph reconstruction
- The reconstruction of multirelations, at least one component of which is a chain
- On the edge reconstruction of graphs embedded on surfaces
- Some results and approaches for reconstruction conjectures
- La reconstruction au sens de Ulam de certaines multirelations binaires. (The reconstruction in Ulam's sense of some binary multirelations)
- Finite orders which are reconstructible up to duality by their comparability graphs
- Edge-reconstruction of minimally 3-connected planar graphs
- The robustness of LWPP and WPP, with an application to graph reconstruction
- Width two posets are reconstructible
- The \((\leq 5)\)-hypomorphy of digraphs up to complementation
- Reconstruction of the path graph
- On the edge-reconstruction of 3-connected planar graphs with minimum valency 4
- Reconstruction of 2-connected parity graphs
- Graphs and their associated inverse semigroups
- A reconstruction problem related to balance equations. II: The general case
- Reconstructing the degree sequence of a sparse graph from a partial deck
- Some work towards the proof of the reconstruction conjecture
- Degree lists and connectedness are 3-reconstructible for graphs with at least seven vertices
- ON α,β DESTRUCTIBLE GRAPHS
- Multiplicity of solutions for the discrete boundary value problem involving the p-Laplacian
- scientific article; zbMATH DE number 3790472 (Why is no real title available?)
- The reconstruction conjecture for finite simple graphs and associated directed graphs
- Operator Decomposition of Graphs and the Reconstruction Conjecture
- Leaf-reconstructibility of phylogenetic networks
- A property of most of the known non-reconstructible digraphs
- Not all phylogenetic networks are leaf-reconstructible
- \((-1)\)-hypomorphic graphs with the same 3-element homogeneous subsets
- Two {4,n-3}-isomorphic n-vertex digraphs are hereditarily isomorphic
- Towards size reconstruction from fewer cards
- Distance hereditary graphs \(G\) of connectivity two or three and \(\operatorname{diam} (G) = \operatorname{diam} (\overline{G}) = 3\) are reconstructible
- The degree-associated reconstruction number of an unicentroidal tree
- On the reconstruction of graph invariants
- On the combinatorial problems which I would most like to see solved
- Ordered sets that are reconstructible from two cards and the number of comparabilities.
- The idiosyncratic polynomial of digraphs
- Families of pairs of graphs with a large number of common cards
- The enumeration of vertex induced subgraphs with respect to the number of components
- Graph kernels: a survey
- The degree sequence is reconstructible from \(n-1\) cards
- Reconstruction of infinite graphs
- Reconstructing the number of blocks of an infinite graph
- \(\{-1\}\)-self dual finite prechains and applications
- A note on non-reconstructible 3-hypergraphs
- Description of the tournaments which are reconstructible from their \(k\)-cycle partial digraphs for \(k\in \{3, 4\}\)
- Graph theory (algorithmic, algebraic, and metric problems)
- A reduction of the graph reconstruction conjecture
- On the edge reconstruction of locally finite disconnected graphs with a finite number of components
- A family of non-reconstructible hypergraphs
- The \(k\)-orbit reconstruction and the orbit algebra
- Hypomorphisms, orbits, and reconstruction
- Sur certains tournois reconstructibles application à leurs groupes d'automorphismes
- The combinatorial \(k\)-deck
- Mathematical problems and games
- Reconstruction of the geometric structure of a set of points in the plane from its geometric tree graph
- Techniques in matroid reconstruction
- A bibliography on chromatic polynomials
- On a reconstruction problem
- Reconstructing degree sequences from k-vertex-deleted subgraphs
- Vertex-switching reconstruction of subgraph numbers and triangle-free graphs
- The double reconstruction conjecture about finite colored hypergraphs
- A census of non-reconstructable digraphs. I: Six related families
- Hereditary isomorphy and \(\{-4\}\)-hypomorphy for tournaments
- Reconstructible graphs, simplicial flag complexes of homology manifolds and associated right-angled Coxeter groups
- What is reconstruction for ordered sets?
- Reconstruction from vertex-switching
- The \((\leq 6)\)-half-reconstructibility of digraphs
- Complexity results in graph reconstruction
- Reconstructing graphs from their k-edge deleted subgraphs
- Reconstructing graphs as subsumed graphs of hypergraphs, and some self- complementary triple systems
- Two metrics in a graph theory modeling of organic chemistry
- Reconstructing trees from two cards
- Reconstruction of k-orbits of a permutation group
- On the power of a perturbation for testing non-isomorphism of graphs
- A semi-strong perfect graph theorem
- Indecomposability graph and indecomposability recognition
- Degree-associated reconstruction number of graphs
- Token graphs
- Reconstructing under group actions.
- Towards the reconstruction of posets
- Reconstructing subsets of \(\mathbb{Z}_n\)
- The \(\{-2,-1\}\)-selfdual and decomposable tournaments
- Note sur le problème de Ulam
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)
