On reconstruction of graphs

Cited in

(31)

Weighted graphs and university course timetabling
The degree sequence is reconstructible from \(n-1\) cards
Rélations non reconstructibles par leurs restrictions
On reconstructing graphs from their sets of subgraphs
Fractional isomorphism of graphs
On a reconstruction problem
On reconstruction of eigenfunctions of Johnson graphs
A conjecture on the reconstruction of graphs from metric balls of their vertices
Reconstruction of maximal outerplanar graphs
Reconstructing the degree pair sequence of a digraph
Rebuilding convex sets in graphs
On the reconstruction of planar graphs
Reconstruction Algorithm for Permutation Graphs
Reconstructing Digraphs from Partial Dadecks
scientific article; zbMATH DE number 5504379 (Why is no real title available?)
scientific article; zbMATH DE number 4023330 (Why is no real title available?)
The graph reconstruction number
scientific article; zbMATH DE number 701116 (Why is no real title available?)
scientific article; zbMATH DE number 1047709 (Why is no real title available?)
scientific article; zbMATH DE number 2028636 (Why is no real title available?)
The adversary degree-associated reconstruction number of double-brooms
Reconstruction of small graphs and digraphs
scientific article; zbMATH DE number 2188393 (Why is no real title available?)
Graph reconstruction from subgraphs
2-reconstructibility of strongly regular graphs and 2-partially distance-regular graphs
Trees with at least 6 +11 vertices are -reconstructible
Acyclic graphs with at least 2 + 1 vertices are -recognizable
Reconstruction of graphs based on random walks
Reconstructing degree sequences from k-vertex-deleted subgraphs
Reconstructing graphs from cut-set sizes
On \({\mathcal C}K_ 1\)-reconstruction of a pair of graphs

This page was built for publication: On reconstruction of graphs

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