Name
Abstract | ||
|---|---|---|
We introduce a natural extension of the vertex degree to ends. For the cycle space C(G) as proposed by Diestel and Kühn [4, 5], which allows for infinite cycles, we prove that the edge set of a locally finite graph G lies in C(G) if and only if every vertex and every end has even degree. In the same way we generalise to locally finite graphs the characterisation of the cycles in a finite graph as its 2-regular connected subgraphs. |
Year | DOI | Venue |
|---|---|---|
2007 | 10.1007/s00493-007-2149-0 | Combinatorica |
Keywords | Field | DocType |
end degree,2-regular connected subgraphs,vertex degree,cycle space c,natural extension,finite graph,infinite cycle | Discrete mathematics,Combinatorics,Vertex (geometry),Vertex (graph theory),Cycle graph,Neighbourhood (graph theory),If and only if,Degree (graph theory),Cycle space,Mathematics,Feedback vertex set | Journal |
Volume | Issue | ISSN |
27 | 3 | 0209-9683 |
Citations | PageRank | References |
20 | 1.63 | 4 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| henning bruhn | 1 | 177 | 24.93 |
| maya stein | 2 | 81 | 15.65 |