Graph reconstruction—a survey

DOI10.1002/JGT.3190010306MaRDI QIDQ4154892zbMATHOpenAlexDBLPWikidataFDO

Authors J. A. Bondy, R. L. Hemminger

Publication date 1977

Published in Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/jgt.3190010306

Mathematics Subject Classification ID

Graph theory (05C99)

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 T₀ + T₅ 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 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
• Equality of graphs up to complementation
• Proof of Harary's conjecture on the reconstruction of trees
• On the complexity of graph reconstruction
• The reconstruction of maximal planar graphs. II: Reconstruction
• Reconstructing the degree sequence and the number of components of an infinite graph
• Reconstruction of sequences
• Quotients of Peck posets
• Positive solutions for discrete boundary value problems involving the p-Laplacian with potential terms
• Hypomorphy of graphs up to complementation
• Reconstructible and Half-Reconstructible Tournaments: Application to Their Groups of Hemimorphisms
• The pairs of \(\{-3\}\)-hypomorphic tournaments
• Simpler counterexamples to the edge-reconstruction conjecture for infinite graphs
• A survey on edge reconstruction of graphs
• Intersection theory for graphs
• The Dirichlet boundary value problems for \(p\)-Schrödinger operators on finite networks
• Reconstructibility and perfect graphs
• Discrete phase retrieval in musical structures
• Some Ulam's reconstruction problems for quantum states
• Size reconstructibility of graphs
• 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

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)