Name
Abstract | ||
|---|---|---|
First a brief survey of known facts is given. Main result of this paper: every polyhedral (i.e. 3-connected planar) graph G with minimum degree at least 4 and order at least k (k ≤ 4) contains a connected subgraph on k vertices having degrees (in G) at most 4k - 1, the bound 4k- 1 being best possible. |
Year | DOI | Venue |
|---|---|---|
2002 | 10.1016/S0012-365X(01)00368-5 | Discrete Mathematics |
Keywords | Field | DocType |
main result,brief survey,polyhedral graph,known fact,subgraph with restricted degrees,3-connected planar graph,3-connected planar,light graph,connected subgraph,graph g,vertex-degree restricted subgraphs,minimum degree,path,planar graph | Discrete mathematics,Combinatorics,Vertex (geometry),Polyhedron,Polyhedral graph,Triangulation (social science),Isomorphism,Degree (graph theory),Connectivity,Mathematics,Planar graph | Journal |
Volume | Issue | ISSN |
256 | 1-2 | Discrete Mathematics |
Citations | PageRank | References |
5 | 0.63 | 10 |
Authors | ||
1 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Igor Fabrici | 1 | 101 | 14.64 |