Name
Abstract | ||
|---|---|---|
Mader proved that every 2-connected simple graph G with minimum degree d exceeding three has a cycle C, the deletion of whose edges leaves a 2-connected graph. Jackson extended this by showing that C may be chosen to avoid any nominated edge of G and to have length at least d - 1. This article proves an extension of Jackson's theorem. In addition, a conjecture of Goddyn, van den Heuvel, and McGuinness is disproved when it is shown that a natural matroid dual of Mader's theorem fails. © 1999 John Wiley & Sons, Inc. J Graph Theory 30: 51–66, 1999 |
Year | DOI | Venue |
|---|---|---|
1999 | 10.1002/(SICI)1097-0118(199901)30:1<>1.0.CO;2-K | Journal of Graph Theory |
Keywords | Field | DocType |
matroid | Discrete mathematics,Combinatorics,k-edge-connected graph,Cubic graph,Cycle graph,Dual graph,Graphic matroid,Graph minor,Mathematics,Planar graph,Branch-decomposition | Journal |
Volume | Issue | ISSN |
30 | 1 | 0364-9024 |
Citations | PageRank | References |
12 | 1.44 | 3 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Manoel Lemos | 1 | 83 | 19.44 |
| James Oxley | 2 | 397 | 57.57 |