The reconstruction of maximal planar graphs. I: Recognition

DOI10.1016/0095-8956(81)90063-0zbMATH Open0413.05035OpenAlexW2015771884MaRDI QIDQ1260041FDOQ1260041

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

• Title not available (Why is that?)
• Graph reconstruction—a survey
• Critically n-Connected Graphs

Cited In (4)

• The reconstruction of maximal planar graphs. II: Reconstruction
• A reduction of the graph reconstruction conjecture
• On the reconstruction of planar graphs
• 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)