Paper Info
Title
Subgraphs with restricted degrees of their vertices in planar graphs
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 4 k + 3, the bound 4 k + 3 being best possible.
Year
DOI
Venue
1998
10.1016/S0012-365X(98)00095-8
Discrete Mathematics
Keywords
DocType
Volume
subgraph with restricted degrees,3-connected planar graph,restricted degree,planar graph,toroidal graph,projective plane graph,path,projective plane
Journal
191
Issue
ISSN
Citations 
1-3
Discrete Mathematics
13
PageRank 
References 
Authors
1.80
1
2
Name
Order
Citations
PageRank
Igor Fabrici110114.64
Stanislav Jendrol'228338.72