Dense graphs and edge reconstructions

DOI10.1007/BF01271270zbMATH Open0881.05098MaRDI QIDQ1375698FDOQ1375698

Authors: Laszló Pyber 

Publication date: 11 January 1998

Published in: Combinatorica (Search for Journal in Brave)

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

zbMATH Keywords

dense graphsset systemsedge reconstruction

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• A note on the line reconstruction problem
• A note on the edge-reconstruction of \(K_{1,m}\)-free graphs
• The edge reconstruction of hamiltonian graphs
• Claw‐free graphs are edge reconstructible

Cited In (6)

• Title not available (Why is that?)
• 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
• Title not available (Why is that?)
• Title not available (Why is that?)

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)