Unavoidable Parallel Minors of 4-Connected Graphs
| dc.creator | Chun, Carolyn | |
| dc.creator | Ding, Guoli | |
| dc.creator | Oporowski, Bogdan | |
| dc.creator | Vertigan, Dirk | |
| dc.date | 2006-06-23 | |
| dc.date | 2008-02-11 | |
| dc.date.accessioned | 2026-07-07T09:19:40Z | |
| dc.date.available | 2026-07-07T09:19:40Z | |
| dc.description | A parallel minor is obtained from a graph by any sequence of edge contractions and parallel edge deletions. We prove that, for any positive integer k, every internally 4-connected graph of sufficiently high order contains a parallel minor isomorphic to a variation of K_{4,k} with a complete graph on the vertices of degree k, the k-partition triple fan with a complete graph on the vertices of degree k, the k-spoke double wheel, the k-spoke double wheel with axle, the (2k+1)-rung Mobius zigzag ladder, the (2k)-rung zigzag ladder, or K_k. We also find the unavoidable parallel minors of 1-, 2-, and 3-connected graphs. | |
| dc.description | 12 pages, 3 figures | |
| dc.identifier | https://arxiv.org/abs/math/0606577 | |
| dc.identifier | http://arxiv.org/abs/math/0606577 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/154477 | |
| dc.subject | Combinatorics | |
| dc.subject | 05C83 | |
| dc.title | Unavoidable Parallel Minors of 4-Connected Graphs | |
| dc.type | text |