Graph reconstruction—a survey
From MaRDI portal
Publication:4154892
DOI10.1002/jgt.3190010306zbMath0375.05040OpenAlexW2075084424WikidataQ56523299 ScholiaQ56523299MaRDI QIDQ4154892
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
Related Items (only showing first 100 items - show all)
Reconstructing graphs from their k-edge deleted subgraphs ⋮ Hypomorphisms, orbits, and reconstruction ⋮ Reconstruction of the path graph ⋮ Reconstruction of the geometric structure of a set of points in the plane from its geometric tree graph ⋮ On the edge-reconstruction of 3-connected planar graphs with minimum valency 4 ⋮ On a reconstruction problem ⋮ The reconstruction conjecture for finite simple graphs and associated directed graphs ⋮ Reconstruction of distance hereditary 2-connected graphs ⋮ Mathematical problems and games ⋮ Width two posets are reconstructible ⋮ A semi-strong perfect graph theorem ⋮ On the reconstruction of planar graphs ⋮ Reconstructing under group actions. ⋮ The \(\{-2,-1\}\)-selfdual and decomposable tournaments ⋮ The idiosyncratic polynomial of digraphs ⋮ Techniques in matroid reconstruction ⋮ 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 ⋮ A bibliography on chromatic polynomials ⋮ Are all pairs of hypomorphic digraphs \(S\)-isomorphic? ⋮ Complexity results in graph reconstruction ⋮ Reconstructibility and perfect graphs ⋮ Reconstruction of k-orbits of a permutation group ⋮ Reconstructing the degree sequence of a sparse graph from a partial deck ⋮ A reconstruction problem related to balance equations ⋮ The centroidal branches of a separable graph are edge reconstructible ⋮ Degree lists and connectedness are 3-reconstructible for graphs with at least seven vertices ⋮ Token graphs ⋮ \(\{-1\}\)-self dual finite prechains and applications ⋮ A census of non-reconstructable digraphs. I: Six related families ⋮ The \((\leq 6)\)-half-reconstructibility of digraphs ⋮ Totally symmetric functions are reconstructible from identification minors ⋮ Sur certains tournois reconstructibles application à leurs groupes d'automorphismes ⋮ Reconstructing the degree sequence and the number of components of an infinite graph ⋮ Reconstruction of finite truncated semi-modular lattices ⋮ Reconstructible graphs, simplicial flag complexes of homology manifolds and associated right-angled Coxeter groups ⋮ Positive solutions for discrete boundary value problems involving the p-Laplacian with potential terms ⋮ Intersection theory for graphs ⋮ The pairs of \(\{-3\}\)-hypomorphic tournaments ⋮ Reconstructing degree sequences from k-vertex-deleted subgraphs ⋮ Indecomposability graph and indecomposability recognition ⋮ Some work towards the proof of the reconstruction conjecture ⋮ Vertex-switching reconstruction of subgraph numbers and triangle-free graphs ⋮ The double reconstruction conjecture about finite colored hypergraphs ⋮ The \((\leq 5)\)-hypomorphy of digraphs up to complementation ⋮ On the combinatorial problems which I would most like to see solved ⋮ The enumeration of vertex induced subgraphs with respect to the number of components ⋮ Simpler counterexamples to the edge-reconstruction conjecture for infinite graphs ⋮ Proof of Harary's conjecture on the reconstruction of trees ⋮ Ordered sets that are reconstructible from two cards and the number of comparabilities. ⋮ 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 ⋮ Families of pairs of graphs with a large number of common cards ⋮ \((-1)\)-hypomorphic graphs with the same 3-element homogeneous subsets ⋮ Reconstruction of infinite graphs ⋮ Finite orders which are reconstructible up to duality by their comparability graphs ⋮ The degree sequence is reconstructible from \(n-1\) cards ⋮ The Dirichlet boundary value problems forp-Schrödinger operators on finite networks ⋮ 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 ⋮ The combinatorial \(k\)-deck ⋮ ON α,β DESTRUCTIBLE GRAPHS ⋮ Unnamed Item ⋮ Graphs and their associated inverse semigroups ⋮ What is reconstruction for ordered sets? ⋮ Degree-associated reconstruction number of graphs ⋮ Hereditary isomorphy and \(\{-4\}\)-hypomorphy for tournaments ⋮ Equality of graphs up to complementation ⋮ Note sur le problème de Ulam ⋮ Graph theory (algorithmic, algebraic, and metric problems) ⋮ The robustness of LWPP and WPP, with an application to graph reconstruction ⋮ Distance hereditary graphs \(G\) of connectivity two or three and \(\operatorname{diam} (G) = \operatorname{diam} (\overline{G}) = 3\) are reconstructible ⋮ A reduction of the graph reconstruction conjecture ⋮ Non-reconstructible locally finite graphs ⋮ Reconstructibility versus edge reconstructibility of infinite graphs ⋮ Towards size reconstruction from fewer cards ⋮ A test for legitimate decks ⋮ Hypomorphy of graphs up to complementation ⋮ The reconstruction of maximal planar graphs. I: Recognition ⋮ The reconstruction of maximal planar graphs. II: Reconstruction ⋮ Reconstructing subsets of \(\mathbb{Z}_n\) ⋮ Some Kähler structures on products of 2-spheres ⋮ Discrete phase retrieval in musical structures ⋮ Reconstructing the number of blocks of an infinite graph ⋮ Not all phylogenetic networks are leaf-reconstructible ⋮ Some Ulam’s reconstruction problems for quantum states ⋮ Towards the reconstruction of posets ⋮ A reconstruction problem related to balance equations. II: The general case ⋮ On the reconstruction of graph invariants ⋮ Quotients of Peck posets ⋮ On the power of a perturbation for testing non-isomorphism of graphs ⋮ Reconstruction from vertex-switching ⋮ On the edge reconstruction of graphs embedded on surfaces ⋮ Some results and approaches for reconstruction conjectures ⋮ Operator Decomposition of Graphs and the Reconstruction Conjecture ⋮ A family of non-reconstructible hypergraphs ⋮ Edge-reconstruction of minimally 3-connected planar graphs ⋮ On the edge reconstruction of locally finite disconnected graphs with a finite number of components
Cites Work
- Unnamed Item
- Unnamed Item
- A congruence theorem for trees
- Reconstructing infinite graphs
- Reconstructing colored graphs
- Reconstructing trees from two point deleted subtrees
- On Ulam's conjecture for separable graphs
- On a conjecture concerning the reconstruction of graphs
- Quelques problèmes combinatoires concernant les ordres totaux et les rélations monomorphes
- A congruence theorem for asymmetric trees
- On some mappings related to graphs
- On the Minimum Order of Graphs with Given Group
- Unicyclic Graphs Satisfy Harary′s Conjecture
- The Reconstruction of a Tree from its Maximal Subtrees
- Reconstruction of Cacti
- Reconstruction of Trees
- ON RECONSTRUCTING DISCONNECTED GRAPHS
- On the Structure of Finite T0 + T5 Spaces
This page was built for publication: Graph reconstruction—a survey
