Abstract
We prove that a planar graph can be partitioned into edge-disjoint circuits of even length, if and only if every vertex has even valency and every block has an even number of edges.
| Original language | English (US) |
|---|---|
| Pages (from-to) | 327-338 |
| Number of pages | 12 |
| Journal | Journal of Combinatorial Theory, Series B |
| Volume | 31 |
| Issue number | 3 |
| DOIs | |
| State | Published - Dec 1981 |
| Externally published | Yes |
All Science Journal Classification (ASJC) codes
- Theoretical Computer Science
- Discrete Mathematics and Combinatorics
- Computational Theory and Mathematics