Name
Abstract | ||
|---|---|---|
By a result of Gallai, every finite graph G has a vertex partition into two parts each inducing an element of its cycle space. This fails for infinite graphs if, as usual, the cycle space is defined as the span of the edge sets of finite cycles in G. However, we show that, for the adaptation of the cycle space to infinite graphs recently introduced by Diestel and Kühn (which involves infinite cycles as well as finite ones), Gallai's theorem extends to locally finite graphs. Using similar techniques, we show that if Seymour's faithful cycle cover conjecture is true for finite graphs then it also holds for locally finite graphs when infinite cyles are allowed in the cover, but not otherwise. We also consider extensions to graphs with infinite degrees. © 2005 Wiley Periodicals, Inc. J Graph Theory |
Year | DOI | Venue |
|---|---|---|
2005 | 10.1002/jgt.v50:2 | Journal of Graph Theory |
Keywords | Field | DocType |
locally finite graph,cycle cover,Gallai | Topology,Discrete mathematics,Combinatorics,Indifference graph,Robertson–Seymour theorem,Chordal graph,Pathwidth,Universal graph,1-planar graph,Mathematics,Maximal independent set,Strong perfect graph theorem | Journal |
Volume | Issue | ISSN |
50 | 2 | 0364-9024 |
Citations | PageRank | References |
15 | 1.62 | 2 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| henning bruhn | 1 | 177 | 24.93 |
| Reinhard Diestel | 2 | 452 | 68.24 |
| maya stein | 3 | 81 | 15.65 |