scientific article

Publication date: 26 June 1992

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items

Finite-type invariants for graphs and graph reconstructions, Realizability and uniqueness in graphs, Reconstruction of distance hereditary 2-connected graphs, Width two posets are reconstructible, On the reconstruction of planar graphs, Reconstructing under group actions., Unnamed Item, 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, Unnamed Item, Complexity results in graph reconstruction, Reconstructing graphs from size and degree properties of their induced \(k\)-subgraphs, Reconstruction of Interval Graphs, Dense graphs and edge reconstructions, Reconstructing the degree sequence of a sparse graph from a partial deck, The centroidal branches of a separable graph are edge reconstructible, Prime orders all of whose prime suborders are selfdual, Degree lists and connectedness are 3-reconstructible for graphs with at least seven vertices, Reconstruction of interval graphs, Maximal proper subgraphs of median graphs, On the edge reconstruction of graphs embedded in surfaces. III, Some results on the reconstruction problems. p‐claw‐free, chordal, and p₄‐reducible graphs, Recovering a tree from the lengths of subtrees spanned by a randomly chosen sequence of leaves, Graph reconstruction and quantum statistical mechanics, \(\{-1\}\)-self dual finite prechains and applications, Size reconstructibility of graphs, Seurat games on Stockmeyer graphs, The \((\leq 6)\)-half-reconstructibility of digraphs, Shotgun reconstruction in the hypercube, Totally symmetric functions are reconstructible from identification minors, Bipartite operator decomposition of graphs and the reconstruction conjecture, Reconstruction of a coloring from its homogeneous sets, Unnamed Item, Unnamed Item, Lexicographic products with high reconstruction numbers, Reconstruction of finite truncated semi-modular lattices, Nonsplit Graphs with Split Maximal Induced Subgraphs, Sketchy tweets: ten minute conjectures in graph theory, Unnamed Item, Unique representability and matroid reconstruction, Unnamed Item, A TOPOLOGICAL VARIATION OF THE RECONSTRUCTION CONJECTURE, The \((\leq 5)\)-hypomorphy of digraphs up to complementation, The enumeration of vertex induced subgraphs with respect to the number of components, Ordered sets that are reconstructible from two cards and the number of comparabilities., Reconstruction number of graphs with unique pendant vertex, Reconstruction of a graph from 2-vicinities of its vertices, Finite orders which are reconstructible up to duality by their comparability graphs, The reconstruction conjecture and edge ideals, Edge reconstruction of the Ihara zeta function, The \(k\)-orbit reconstruction and the orbit algebra, Operator decomposition of graphs and the reconstruction conjecture, Problems from CGCS Luminy, May 2007, Reconstructing infinite sets of integers, What is reconstruction for ordered sets?, Degree-associated reconstruction number of graphs, Hereditary isomorphy and \(\{-4\}\)-hypomorphy for tournaments, Reconstructing finite sets of points in \(R^n\) up to groups of isometries, 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, Hypomorphy of graphs up to complementation, Reconstructing subsets of \(\mathbb{Z}_n\), Reconstructing compact metrizable spaces, The poset of graphs ordered by induced containment, Rigidity and reconstruction for graphs, Reconstructing the number of blocks of an infinite graph, Towards the reconstruction of posets, On the reconstruction of graph invariants, Degree associated edge reconstruction number of split graphs with biregular independent set is one, Two {4,n-3}-isomorphic n-vertex digraphs are hereditarily isomorphic, On the edge reconstruction of graphs embedded on surfaces, Reconstruction of a graph from 2–vicinities of its vertices, Edge-reconstruction of minimally 3-connected planar graphs, On a reconstruction problem of Harary and Manvel