On the fixed edge of planar graphs with minimum degree five

DOI10.1016/0012-365X(94)00280-VzbMath0858.05078MaRDI QIDQ1917509

Bao-Gang Xu, Hong Bing Fan

Publication date: 23 March 1997

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

zbMATH Keywords

planar graphfixed edgegraph reconstructiontrunkedge reconstructible

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items

Almost every graph has a fixed edge

Cites Work

• Unnamed Item
• Unnamed Item
• Fixing subgraphs and Ulam's conjecture
• The reconstruction for separable graphs with 2-connected trunks that are series-parallel networks
• Fixing subgraphs
• Edge‐reconstruction of planar graphs with minimum valency 5