Name
Abstract | ||
|---|---|---|
ABSTRACT We prove that, for every positive integer k, there is an integer N such that every 3-connected graph with at least N vertices has a minor isomorphic to the k-spoke wheel or K3;k; and that every internally 4-connected graph with at least N vertices has a minor isomorphic to the 2k-spoke double wheel, the k-rung circular ladder, the k-rung M obius ladder, or K4;k. We also prove an analogous result for innite graphs. 2 |
Year | DOI | Venue |
|---|---|---|
1993 | 10.1006/jctb.1993.1019 | J. Comb. Theory, Ser. B |
Keywords | Field | DocType |
typical subgraphs,4-connected graph,connected graph | Discrete mathematics,Wheel graph,Combinatorics,Graph toughness,Graph isomorphism,Cycle graph,Independent set,Möbius ladder,Planar graph,Mathematics,Path graph | Journal |
Volume | Issue | ISSN |
57 | 2 | Journal of Combinatorial Theory, Series B |
Citations | PageRank | References |
37 | 3.54 | 3 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Bogdan Oporowski | 1 | 266 | 23.24 |
| James Oxley | 2 | 397 | 57.57 |
| Robin Thomas | 3 | 37 | 3.54 |