Title of article
Subgraphs with restricted degrees of their vertices in planar graphs Original Research Article
Author/Authors
Igor Fabrici، نويسنده , , Stanislav Jendrol’، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 1998
Pages
8
From page
83
To page
90
Abstract
We prove that every 3-connected planar graph G of order at least k contains a connected subgraph H on k vertices each of which has degree (in G) at most 4k + 3, the bound 4k + 3 being best possible.
Keywords
3-Connected planar graph , Path , Subgraph with restricted degrees , Projective plane graph , Toroidal graph
Journal title
Discrete Mathematics
Serial Year
1998
Journal title
Discrete Mathematics
Record number
951182
Link To Document