Name
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 minimum 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) , every G ∈ G has a subgraph isomorphic to H whose vertices have a degree in G which is restricted by a number q = q(H,G). In the case R(H) ≥ c, such a restriction does not exist if H has a vertex of degree ≥ 5 or if H is 3-connected. |
Year | DOI | Venue |
|---|---|---|
2002 | 10.1016/S0012-365X(01)00330-2 | Discrete Mathematics |
Keywords | Field | DocType |
restricted vertex degree,number q,05c38,minimum vertex degree,light graph,light subgraph,05c10,planar graph h,maximum face size,4-connected planar graph,subgraph isomorphic,polyhedral supergraphs g,case r,non-empty family,planar graph | Graph theory,Discrete mathematics,Combinatorics,Vertex (geometry),Subgroup,Cycle graph,Isomorphism,Degree (graph theory),Connectivity,Planar graph,Mathematics | Journal |
Volume | Issue | ISSN |
251 | 1 | Discrete Mathematics |
Citations | PageRank | References |
2 | 0.39 | 5 |
Authors | ||
1 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Erhard Hexel | 1 | 24 | 4.54 |