scientific article; zbMATH DE number 871166

zbMATH Open0847.05073MaRDI QIDQ4874584FDOQ4874584

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

Publication date: 1996

Title of this publication is not available (Why is that?)

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

zbMATH Keywords

degree sequenceset edge-reconstruction

Mathematics Subject Classification ID

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

Cited In (13)

• On the reconstruction of the degree sequence
• Claw‐free graphs are edge reconstructible
• Edge-recognizable domination numbers.
• On the edge-reconstruction number of disconnected graphs
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• The edge reconstruction of hamiltonian graphs
• Edge orbits and edge-deleted subgraphs
• Bidegreed graphs are edge reconstructible
• Title not available (Why is that?)
• Disproof of a conjecture in graph reconstruction theory
• Title not available (Why is that?)

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)