The reconstruction of maximal planar graphs. I: Recognition

DOI10.1016/0095-8956(81)90063-0MaRDI QIDQ1260041zbMATH OpenOpenAlexFDO

Authors K. Appert

Publication date 1981

Published in Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0095-8956(81)90063-0

zbMATH Keywords

reconstructionrecognitionmaximal planar graphs

Mathematics Subject Classification ID

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

Cites work

• scientific article; zbMATH DE number 3290993 (Why is no real title available?)
• Critically n-Connected Graphs
• Graph reconstruction—a survey

Cited in

(4)

• On the reconstruction of planar graphs
• A reduction of the graph reconstruction conjecture
• The reconstruction of maximal planar graphs. II: Reconstruction
• The reconstruction conjecture for finite simple graphs and associated directed graphs

This page was built for publication: The reconstruction of maximal planar graphs. I: Recognition

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