Graph reconstruction—a survey

DOI10.1002/JGT.3190010306zbMATH Open0375.05040DBLPjournals/jgt/BondyH77OpenAlexW2075084424WikidataQ56523299 ScholiaQ56523299MaRDI QIDQ4154892FDOQ4154892

Cites Work

Cited In (only showing first 100 items - show all)

\(\{-1\}\)-self dual finite prechains and applications
On the reconstruction of graph invariants
Reconstructing trees from two cards
Reconstruction of k-orbits of a permutation group
The \((\leq 6)\)-half-reconstructibility of digraphs
Totally symmetric functions are reconstructible from identification minors
On a reconstruction problem
On the complexity of graph reconstruction
Reconstruction of the geometric structure of a set of points in the plane from its geometric tree graph
A bibliography on chromatic polynomials
Reconstruction of infinite graphs
The \(k\)-orbit reconstruction and the orbit algebra
Reconstructing under group actions.
Reconstructing subsets of \(\mathbb{Z}_n\)
The \(\{-2,-1\}\)-selfdual and decomposable tournaments
Quotients of Peck posets
The Dirichlet boundary value problems for \(p\)-Schrödinger operators on finite networks
On the combinatorial problems which I would most like to see solved
Techniques in matroid reconstruction
Graph Kernels: A Survey
A census of non-reconstructable digraphs. I: Six related families
Discrete phase retrieval in musical structures
The degree sequence is reconstructible from \(n-1\) cards
Graph theory (algorithmic, algebraic, and metric problems)
Reconstructing graphs as subsumed graphs of hypergraphs, and some self- complementary triple systems
Proof of Harary's conjecture on the reconstruction of trees
Reconstructibility and perfect graphs
Sur certains tournois reconstructibles application à leurs groupes d'automorphismes
The combinatorial \(k\)-deck
Mathematical problems and games
What is reconstruction for ordered sets?
Two metrics in a graph theory modeling of organic chemistry
On the power of a perturbation for testing non-isomorphism of graphs
The double reconstruction conjecture about finite colored hypergraphs
The reconstruction of maximal planar graphs. II: Reconstruction
A family of non-reconstructible hypergraphs
Complexity results in graph reconstruction
A semi-strong perfect graph theorem
Note sur le problème de Ulam
Hereditary isomorphy and \(\{-4\}\)-hypomorphy for tournaments
Ordered sets that are reconstructible from two cards and the number of comparabilities.
Reconstructing the number of blocks of an infinite graph
Token graphs
Towards the reconstruction of posets
The idiosyncratic polynomial of digraphs
Reconstructible graphs, simplicial flag complexes of homology manifolds and associated right-angled Coxeter groups
Some Ulam’s reconstruction problems for quantum states
The enumeration of vertex induced subgraphs with respect to the number of components
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\}\)
The pairs of \(\{-3\}\)-hypomorphic tournaments
Size reconstructibility of graphs
Reconstructing degree sequences from k-vertex-deleted subgraphs
Vertex-switching reconstruction of subgraph numbers and triangle-free graphs
Positive solutions for discrete boundary value problems involving the p-Laplacian with potential terms
Reconstruction from vertex-switching
Reconstructing graphs from their k-edge deleted subgraphs
Degree-associated reconstruction number of graphs
A reduction of the graph reconstruction conjecture
Equality of graphs up to complementation
Hypomorphy of graphs up to complementation
Families of pairs of graphs with a large number of common cards
Reconstruction of sequences
Indecomposability graph and indecomposability recognition
On the edge reconstruction of locally finite disconnected graphs with a finite number of components
Hypomorphisms, orbits, and reconstruction
Simpler counterexamples to the edge-reconstruction conjecture for infinite graphs
Reconstructible and Half-Reconstructible Tournaments: Application to Their Groups of Hemimorphisms
A survey on edge reconstruction of graphs
Intersection theory for graphs
Finite orders which are reconstructible up to duality by their comparability graphs
Graphs and their associated inverse semigroups
Operator Decomposition of Graphs and the Reconstruction Conjecture
Reconstruction of finite truncated semi-modular lattices
Two {4,n-3}-isomorphic n-vertex digraphs are hereditarily isomorphic
Not all phylogenetic networks are leaf-reconstructible
A test for legitimate decks
The reconstruction of maximal planar graphs. I: Recognition
Title not available (Why is that?)
\((-1)\)-hypomorphic graphs with the same 3-element homogeneous subsets
Vertex-substitution framework verifies the reconstruction conjecture for finite undirected graphs
Some work towards the proof of the reconstruction conjecture
Non-reconstructible locally finite graphs
Recognizing connectedness from vertex-deleted subgraphs
Reconstruction of the path graph
Reconstruction of distance hereditary 2-connected graphs
Title not available (Why is that?)
The robustness of LWPP and WPP, with an application to graph reconstruction
A reconstruction problem related to balance equations. II: The general case
A reconstruction problem related to balance equations
ON α,β DESTRUCTIBLE GRAPHS
Reconstructing the degree sequence and the number of components of an infinite graph
Title not available (Why is that?)
Reconstruction and edge reconstruction of triangle-free graphs
Degree associated reconstruction number of certain connected graphs with unique end vertex and a vertex of degree n−2
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
Are all pairs of hypomorphic digraphs \(S\)-isomorphic?

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)