Name
Abstract | ||
|---|---|---|
By Petersen's theorem, a bridgeless cubic graph has a 2-factor. H. Fleischner extended this result to bridgeless graphs of minimum degree at least three by showing that every such graph has a spanning even subgraph. Our main result is that, under the stronger hypothesis of 3-edge-connectivity, we can find a spanning even subgraph in which every component has at least five vertices. We show that this is in some sense best possible by constructing an infinite family of 3-edge-connected graphs in which every spanning even subgraph has a 5-cycle as a component. © 2009 Wiley Periodicals, Inc. J Graph Theory 62: 37–47, 2009 This research was carried out while the second author was visiting Queen Mary, University of London. |
Year | DOI | Venue |
|---|---|---|
2009 | 10.1002/jgt.v62:1 | Journal of Graph Theory |
Keywords | Field | DocType |
triangle free graph,bipartite graph,cubic graph,connected graph,factor h | Pseudoforest,Topology,Discrete mathematics,Combinatorics,Forbidden graph characterization,Graph factorization,Distance-hereditary graph,Factor-critical graph,Petersen graph,Universal graph,Pancyclic graph,Mathematics | Journal |
Volume | Issue | ISSN |
62 | 1 | 0364-9024 |
Citations | PageRank | References |
11 | 0.92 | 8 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Bill Jackson | 1 | 529 | 55.68 |
| Kiyoshi Yoshimoto | 2 | 133 | 22.65 |