Name
Abstract | ||
|---|---|---|
It is proved that every 3-connected planar graph G with δ ( G )⩾4 either does not contain any path on k ⩾8 vertices or must contain a path on k vertices ( k ⩾8) having degree (in G) at most 5 k −7; the bound 5 k −7 is shown to be the best possible. For every connected planar graph H different from a path and for every integer m ⩾4 there is a 3-connected planar graph G with δ ( G )⩾4 such that each subgraph of G isomorphic to H has a vertex x with deg G ( x )⩾ m . |
Year | DOI | Venue |
|---|---|---|
2000 | 10.1016/S0012-365X(99)00209-5 | Discrete Mathematics |
Keywords | Field | DocType |
polyhedral graph,subgraph with restricted degrees,3-connected planar graph,4-connected planar graph,vertex-degree restricted path,path,planar graph | Discrete mathematics,Combinatorics,k-vertex-connected graph,Bound graph,Graph power,Polyhedral graph,Cycle graph,Neighbourhood (graph theory),Degree (graph theory),Mathematics,Path graph | Journal |
Volume | Issue | ISSN |
212 | 1-2 | Discrete Mathematics |
Citations | PageRank | References |
18 | 1.91 | 0 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Igor Fabrici | 1 | 101 | 14.64 |
| Erhard Hexel | 2 | 24 | 4.54 |
| Stanislav Jendrol' | 3 | 283 | 38.72 |
| Hansjoachim Walther | 4 | 97 | 20.10 |