Abstract
AbstractThe Edge Reconstruction Conjecture states that all graphs with at least four edges are determined by their edge‐deleted subgraphs. We prove that this is true for claw‐free graphs, those graphs with no induced subgraph isomorphic to K1,3. This includes line graphs as a special case.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
