Reconstruction of a Pair of Graphs from their Concatenations

DOI10.1137/0601026zbMath0499.05044OpenAlexW2034452541MaRDI QIDQ3964610

James B. Shearer, Sukhamay Kundu, E. Sampathkumar, Dean G. Sturtevant

Publication date: 1980

Published in: SIAM Journal on Algebraic Discrete Methods (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/6f036d5efca3c1111493f2bab9624e299374a521

zbMATH Keywords

concatenation of two vertex disjoint graphs

Mathematics Subject Classification ID

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

Related Items (1)

Further results on Erdős–Faber–Lovász conjecture

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A congruence theorem for trees
• Reconstruction of a tree from its homomorphic images and other related transforms
• The reconstruction of outerplanar graphs
• On Ulam's conjecture for separable graphs
• The Reconstruction of a Tree from its Maximal Subtrees
• Reconstruction of Trees

This page was built for publication: Reconstruction of a Pair of Graphs from their Concatenations