scientific article; zbMATH DE number 3258862
From MaRDI portal
zbMath0161.43404MaRDI QIDQ5544087
Publication date: 1964
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
Balance equations for reconstruction problems, Reconstructing graphs from their k-edge deleted subgraphs, Reconstructing Words from Right-Bounded-Block Words, Finite-type invariants for graphs and graph reconstructions, Combinatorial reconstruction problems, On the reconstruction of planar graphs, Techniques in matroid reconstruction, Unnamed Item, Complexity results in graph reconstruction, On the complexity of graph reconstruction, On the fixed edge of planar graphs with minimum degree five, Prime orders all of whose prime suborders are selfdual, On the edge reconstruction of graphs embedded in surfaces. III, Growth rates of permutation classes: categorization up to the uncountability threshold, Degree associated edge reconstruction number of graphs, Shotgun reconstruction in the hypercube, Totally symmetric functions are reconstructible from identification minors, Interview with Karim Adiprasito, Unnamed Item, Vertex-substitution framework verifies the reconstruction conjecture for finite undirected graphs, Nonsplit Graphs with Split Maximal Induced Subgraphs, Graph theoretic models, Reconstruction and edge reconstruction of triangle-free graphs, The double reconstruction conjecture about finite colored hypergraphs, Edge-recognizable domination numbers., On a new digraph reconstruction conjecture, Proof of Harary's conjecture on the reconstruction of trees, Reconstruction number of graphs with unique pendant vertex, Reconstruction of a graph from 2-vicinities of its vertices, Reconstruction of infinite graphs, Edge reconstruction of the Ihara zeta function, Reconstructing compositions, Reconstruction of small graphs and digraphs, Reconstructing infinite sets of integers, The reconstruction of outerplanar graphs, What is reconstruction for ordered sets?, The edge reconstruction hypothesis is true for graphs with more than \(n\cdot \log_2\,n\) edges, On reconstructing graphs from their sets of subgraphs, A reduction of the graph reconstruction conjecture, Graphs with arbitrarily large adversary degree associated reconstruction number, Realization problems on reachability sequences, A simpler counterexample to the reconstruction conjecture for denumerable graphs, Reconstruction of maximal outerplanar graphs, A note on the line reconstruction problem, Bemerkungen zur Ulam-Vermutung, Reconstructing the n-connected components of a graph, Determining connectedness from subdigraphs, Rigidity and reconstruction for graphs, Some Ulam’s reconstruction problems for quantum states, On reconstructing maximal outerplanar graphs, Some basic observations on Kelly's conjecture for graphs, Reconstruction of a tree from its homomorphic images and other related transforms, Degree Associated Edge Reconstruction Number of Graphs with Regular Pruned Graph, N-reconstructibility of non-reconstructible digraphs, Degree associated edge reconstruction number of split graphs with biregular independent set is one, The reconstruction of a tree from its number deck, Reconstruction of a graph from 2–vicinities of its vertices, Edge-reconstruction of minimally 3-connected planar graphs, Reconstructing Words from Right-Bounded-Block Words, On a reconstruction problem of Harary and Manvel
