The class reconstruction number of maximal planar graphs

DOI10.1007/BF01788528MaRDI QIDQ1820795zbMATH OpenFDO

Authors Frank Harary, Josef Lauri

Publication date 1987

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

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

zbMATH Keywords

maximal planar graph reconstruction numberreconstruction number

Mathematics Subject Classification ID

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

Recommendations

• The graph reconstruction number
• scientific article; zbMATH DE number 4135985
• On the reconstruction of planar graphs
• scientific article; zbMATH DE number 2188393
• Reconstruction number of graphs with unique pendant vertex

Cites work

• Critically n-Connected Graphs
• scientific article; zbMATH DE number 3241107 (Why is no real title available?)
• scientific article; zbMATH DE number 3290993 (Why is no real title available?)
• The graph reconstruction number

Cited in

(2)

• scientific article; zbMATH DE number 4135985 (Why is no real title available?)
• Almost every graph has reconstruction number three

This page was built for publication: The class reconstruction number of maximal planar graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1820795)