scientific article; zbMATH DE number 871166

zbMATH Open0847.05073MaRDI QIDQ4874584FDOQ4874584

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

Publication date: 1996

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

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 (6)

• On the reconstruction of the degree sequence
• Edge-recognizable domination numbers.
• Title not available (Why is that?)
• Title not available (Why is that?)
• Edge orbits and edge-deleted subgraphs
• Disproof of a conjecture in graph reconstruction theory

   Recommendations

• On the reconstruction of the degree sequence 👍 👎
• Bidegreed graphs are edge reconstructible 👍 👎
• Claw‐free graphs are edge reconstructible 👍 👎
• Title not available (Why is that?) 👍 👎
• Some applications of the Nash-Williams lemma to the edge-reconstruction conjecture 👍 👎

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)