Some results on the reconstruction problems. p‐claw‐free, chordal, and p4‐reducible graphs

DOI10.1002/jgt.3190190409zbMath0831.05048OpenAlexW1998173219MaRDI QIDQ4842708

Bhalchandra D. Thatte

Publication date: 16 August 1995

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.3190190409

zbMATH Keywords

isomorphismchordal graphsclawclaw-free graphsreconstruction problemsedge reconstructibilityedge reconstructiblevertex reconstructibilityclaw-point

Mathematics Subject Classification ID

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

Related Items (1)

Unnamed Item

Cites Work

• A congruence theorem for trees
• Unnamed Item

This page was built for publication: Some results on the reconstruction problems. p‐claw‐free, chordal, and p₄‐reducible graphs