scientific article; zbMATH DE number 871166

MaRDI QIDQ4874584zbMATHFDO

Authors Lars Døvling Andersen, Songkang Ding, Preben Dahl Vestergaard

Publication date 1996

zbMATH Keywords

degree sequenceset edge-reconstruction

Mathematics Subject Classification ID

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

Recommendations

• On the reconstruction of the degree sequence
• Bidegreed graphs are edge reconstructible
• Claw‐free graphs are edge reconstructible
• scientific article; zbMATH DE number 4087701
• Some applications of the Nash-Williams lemma to the edge-reconstruction conjecture

Cited in

(13)

• Claw‐free graphs are edge reconstructible
• On the edge-reconstruction number of disconnected graphs
• scientific article; zbMATH DE number 4150218 (Why is no real title available?)
• On the reconstruction of the degree sequence
• Disproof of a conjecture in graph reconstruction theory
• Edge orbits and edge-deleted subgraphs
• The edge reconstruction of hamiltonian graphs
• scientific article; zbMATH DE number 2188428 (Why is no real title available?)
• Bidegreed graphs are edge reconstructible
• Edge-recognizable domination numbers.
• scientific article; zbMATH DE number 3987321 (Why is no real title available?)
• scientific article; zbMATH DE number 734471 (Why is no real title available?)
• scientific article; zbMATH DE number 4077273 (Why is no real title available?)

This page was built for publication:

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