scientific article
From MaRDI portal
Publication:3870936
zbMath0433.05045MaRDI QIDQ3870936
Publication date: 1978
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
survey papertreesdirected graphsedge-reconstructioninfinite graphsgraph reconstruction conjectureLovasz- Müller theorem
Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)
Related Items
Hypomorphisms, orbits, and reconstruction, Finite-type invariants for graphs and graph reconstructions, Fractional isomorphism of graphs, Combinatorial reconstruction problems, A note on the edge-reconstruction of \(K_{1,m}\)-free graphs, A note on non-reconstructible 3-hypergraphs, Complexity results in graph reconstruction, Reconstructing the degree sequence of a sparse graph from a partial deck, A larger class of reconstructible tournaments, Constructing trees with given eigenvalues and angles, Shotgun reconstruction in the hypercube, Totally symmetric functions are reconstructible from identification minors, Unnamed Item, Unique representability and matroid reconstruction, Reconstructing degree sequences from k-vertex-deleted subgraphs, Switching reconstruction and diophantine equations, Simpler counterexamples to the edge-reconstruction conjecture for infinite graphs, Reconstruction number of graphs with unique pendant vertex, Reconstruction of infinite graphs, What is reconstruction for ordered sets?, The robustness of LWPP and WPP, with an application to graph reconstruction, A reduction of the graph reconstruction conjecture, Tough graphs and Hamiltonian circuits., Reconstructing the number of blocks of an infinite graph, Degree associated edge reconstruction number of split graphs with biregular independent set is one, On the edge reconstruction of locally finite disconnected graphs with a finite number of components, Population recovery and partial identification
