On even circuit decompositions of eulerian graphs |
| |
Authors: | Cun-Quan Zhang |
| |
Abstract: | Let G be an eulerian graph without odd block. It was proved by P. D. Seymour that if G is planar, then E(G) has a circuit decomposition F such that each circuit of F is of even length. In this paper the theorem of Seymour is generalized: If G contains no subgraph contractible to K5, then E(G) has an even circuit decomposition. |
| |
Keywords: | |
|
|