On the edge-reconstruction of 3-connected planar graphs with minimum valency 4

DOI10.1016/0012-365X(93)E0133-OzbMath0863.05059MaRDI QIDQ1343797

Yue Zhao

Publication date: 20 May 1997

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

planar graphvalencyedge-reconstructible

Mathematics Subject Classification ID

Trees (05C05) Connectivity (05C40) 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
• Reconstructing the n-connected components of a graph
• Edge‐reconstruction of planar graphs with minimum valency 5
• Graph reconstruction—a survey
• On the edge-reconstruction of planar graphs

This page was built for publication: On the edge-reconstruction of 3-connected planar graphs with minimum valency 4