scientific article

zbMath1086.05051MaRDI QIDQ3374778

Paolo Dulio, Virgilio Pannone

Publication date: 22 February 2006

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

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

Mathematics Subject Classification ID

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

Related Items (1)

Joining caterpillars and stability of the tree center

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A congruence theorem for trees
• Finite undirected graphs which are not reconstructible from their large cardinality subgraphs
• The reconstruction of maximal planar graphs. II: Reconstruction
• Reconstructing the n-connected components of a graph
• Almost every graph has reconstruction number three
• The graph reconstruction number
• Reconstruction of Cacti

This page was built for publication: