A note on the edge-reconstruction of \(K_{1,m}\)-free graphs

DOI10.1016/0095-8956(90)90033-VzbMath0645.05051OpenAlexW1993533260MaRDI QIDQ1102982

Ilia Krasikov

Publication date: 1990

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0095-8956(90)90033-v

zbMATH Keywords

edge reconstruction conjecturek(1,m)-free graphsstar free graphs

Mathematics Subject Classification ID

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

Related Items (3)

A survey on edge reconstruction of graphs ⋮ Claw-free graphs---a survey ⋮ Dense graphs and edge reconstructions

Cites Work

• The edge reconstruction hypothesis is true for graphs with more than n log n edges
• The edge reconstruction of hamiltonian graphs
• On the reconstruction of a graph from its closure function
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A note on the edge-reconstruction of \(K_{1,m}\)-free graphs