Dense graphs and edge reconstructions

DOI10.1007/BF01271270MaRDI QIDQ1375698zbMATH OpenFDO

Authors Laszló Pyber

Publication date 11 January 1998

Published in Combinatorica (Search for Journal in Brave)

zbMATH Keywords

dense graphsset systemsedge reconstruction

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 4077273
• scientific article; zbMATH DE number 4162922
• Some applications of the Nash-Williams lemma to the edge-reconstruction conjecture
• On the Nash-Williams' lemma in graph reconstruction theory
• Some results and approaches for reconstruction conjectures

Cites work

• scientific article; zbMATH DE number 17789 (Why is no real title available?)
• scientific article; zbMATH DE number 68355 (Why is no real title available?)
• A note on the edge-reconstruction of \(K_{1,m}\)-free graphs
• A note on the line reconstruction problem
• Claw‐free graphs are edge reconstructible
• The edge reconstruction of hamiltonian graphs

Cited in

(6)

• scientific article; zbMATH DE number 4162922 (Why is no real title available?)
• Some results and approaches for reconstruction conjectures
• The edge reconstruction of hamiltonian graphs
• Some applications of the Nash-Williams lemma to the edge-reconstruction conjecture
• scientific article; zbMATH DE number 4077273 (Why is no real title available?)
• scientific article; zbMATH DE number 7029306 (Why is no real title available?)

This page was built for publication: Dense graphs and edge reconstructions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1375698)