The converse of Kelly's lemma and control-classes in graph reconstruction

MaRDI QIDQ3374778zbMATH OpenFDO

Authors Paolo Dulio, Virgilio Pannone

Publication date 22 February 2006

Full work available at URL https://eudml.org/doc/32448

Mathematics Subject Classification ID

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

Recommendations

• Graph reconstruction from subgraphs
• Graph reconstruction -- some new developments
• scientific article; zbMATH DE number 772776
• Publication:3469126
• An algebraic formulation of the graph reconstruction conjecture

Cites work

• scientific article; zbMATH DE number 4077274 (Why is no real title available?)
• scientific article; zbMATH DE number 4110732 (Why is no real title available?)
• scientific article; zbMATH DE number 3739586 (Why is no real title available?)
• scientific article; zbMATH DE number 17789 (Why is no real title available?)
• A congruence theorem for trees
• Almost every graph has reconstruction number three
• Finite undirected graphs which are not reconstructible from their large cardinality subgraphs
• Reconstructing the n-connected components of a graph
• Reconstruction of Cacti
• The graph reconstruction number
• The reconstruction of maximal planar graphs. II: Reconstruction
• Trees with the same path-table

Cited in

(2)

• Joining caterpillars and stability of the tree center
• On a generalization of Kelly's combinatorial lemma

This page was built for publication: The converse of Kelly's lemma and control-classes in graph reconstruction

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