Title of article :
On light graphs in the family of 4-connected planar graphs Original Research Article
Author/Authors :
Erhard Hexel، نويسنده ,
Issue Information :
روزنامه با شماره پیاپی سال 2002
Pages :
5
From page :
103
To page :
107
Abstract :
Let G be the family of all c-connected (c=4 or 5) polyhedral supergraphs G of a given connected planar graph H where the mimimum vertex degree of G is 5. Let R(H) denote the maximum face size of H. We have proved for all non-empty families G: In the case R(H)
Keywords :
Restricted vertex degree , Light subgraph , 4-connected planar graph
Journal title :
Discrete Mathematics
Serial Year :
2002
Journal title :
Discrete Mathematics
Record number :
950095
Link To Document :
