Some applications of the Nash-Williams lemma to the edge-reconstruction conjecture

DOI10.1007/BF01787478zbMath0702.05060OpenAlexW2005598715WikidataQ122983493 ScholiaQ122983493MaRDI QIDQ914704

Ilia Krasikov, Yehuda Roditty

Publication date: 1990

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01787478

zbMATH Keywords

edge-reconstructibilityfourdegreed graph

Mathematics Subject Classification ID

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

Related Items (1)

A survey on edge reconstruction of graphs

Cites Work

• Unnamed Item
• Balance equations for reconstruction problems
• Combinatorial reconstruction problems
• Graphical partially ordered sets
• Bidegreed graphs are edge reconstructible
• On the reconstruction of a graph from its closure function

This page was built for publication: Some applications of the Nash-Williams lemma to the edge-reconstruction conjecture