z-logo
Premium
Edge‐reconstruction of 4‐connected planar graphs
Author(s) -
Fiorini S.,
Lauri J.
Publication year - 1982
Publication title -
journal of graph theory
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.164
H-Index - 54
eISSN - 1097-0118
pISSN - 0364-9024
DOI - 10.1002/jgt.3190060105
Subject(s) - combinatorics , mathematics , planar graph , enhanced data rates for gsm evolution , planar , object (grammar) , 1 planar graph , pathwidth , planar straight line graph , chordal graph , discrete mathematics , graph , computer science , line graph , artificial intelligence , computer graphics (images)
The object of this paper is to show that 4‐connected planar graphs are uniquely determined from their collection of edge‐deleted subgraphs.

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here