The reconstruction of maximal planar graphs. II: Reconstruction

DOI10.1016/0095-8956(81)90064-2zbMath0413.05036OpenAlexW2038614819MaRDI QIDQ1260042

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)90064-2

zbMATH Keywords

reconstructionmaximal planar graphs

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) 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 (9)

The reconstruction conjecture for finite simple graphs and associated directed graphs ⋮ On the reconstruction of planar graphs ⋮ Reconstructing the degree sequence of a sparse graph from a partial deck ⋮ Unnamed Item ⋮ Proof of Harary's conjecture on the reconstruction of trees ⋮ Families of pairs of graphs with a large number of common cards ⋮ Graph theory (algorithmic, algebraic, and metric problems) ⋮ Recognizing connectedness from vertex-deleted subgraphs ⋮ A reduction of the graph reconstruction conjecture

Cites Work

• The reconstruction of maximal planar graphs. I: Recognition
• Graph reconstruction—a survey
• Critically n-Connected Graphs
• Unnamed Item
• Unnamed Item

This page was built for publication: The reconstruction of maximal planar graphs. II: Reconstruction