scientific article; zbMATH DE number 3258862

Cited in

(62)

N-reconstructibility of non-reconstructible digraphs
The reconstruction of a tree from its number deck
Balance equations for reconstruction problems
Reconstructing graphs from their k-edge deleted subgraphs
Combinatorial reconstruction problems
On the edge reconstruction of graphs embedded in surfaces. III
Graph theoretic models
On a new digraph reconstruction conjecture
Proof of Harary's conjecture on the reconstruction of trees
Reconstruction of infinite graphs
The edge reconstruction hypothesis is true for graphs with more than n _2\,n edges
On reconstructing graphs from their sets of subgraphs
Edge-reconstruction of minimally 3-connected planar graphs
Techniques in matroid reconstruction
Edge-recognizable domination numbers.
Edge reconstruction of the Ihara zeta function
What is reconstruction for ordered sets?
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
On a reconstruction problem of Harary and Manvel
Finite-type invariants for graphs and graph reconstructions
On the fixed edge of planar graphs with minimum degree five
Growth rates of permutation classes: categorization up to the uncountability threshold
Reconstruction number of graphs with unique pendant vertex
The reconstruction of outerplanar graphs
Rigidity and reconstruction for graphs
Reconstructing compositions
A reduction of the graph reconstruction conjecture
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
On the reconstruction of planar graphs
Some Ulam's reconstruction problems for quantum states
Reconstruction of a graph from 2–vicinities of its vertices
Degree associated edge reconstruction number of graphs
On the complexity of graph reconstruction
Graphs with arbitrarily large adversary degree associated reconstruction number
Description of the orders which are hereditarily half-reconstructible by their comparability graphs
Degree Associated Edge Reconstruction Number of Graphs with Regular Pruned Graph
Degree associated edge reconstruction number of split graphs with biregular independent set is one
Reconstructing words from right-bounded-block words
Reconstruction of small graphs and digraphs
Degree associated edge reconstruction parameters of strong double brooms
Realization problems on reachability sequences
Prime orders all of whose prime suborders are selfdual
Shotgun reconstruction in the hypercube
Interview with Karim Adiprasito
Vertex-substitution framework verifies the reconstruction conjecture for finite undirected graphs
Nonsplit Graphs with Split Maximal Induced Subgraphs
Reconstructing Words from Right-Bounded-Block Words
Reconstruction and edge reconstruction of triangle-free graphs
Reconstructing infinite sets of integers
On the expressibility of the reconstructional color refinement
Reconstructing random pictures
Algorithm for reconstruction number of split graphs
Complexity results in graph reconstruction
The double reconstruction conjecture about finite colored hypergraphs
Reconstruction of a graph from 2-vicinities of its vertices

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5544087)