Sciweavers

JCT
2010
158views more  JCT 2010»
13 years 10 months ago
An asymptotic solution to the cycle decomposition problem for complete graphs
Let m1, m2, . . . , mt be a list of integers. It is shown that there exists an integer N such that for all n ≥ N, the complete graph of order n can be decomposed into edge-disjo...
Darryn E. Bryant, Daniel Horsley
DM
2010
83views more  DM 2010»
13 years 11 months ago
Packing edge-disjoint cycles in graphs and the cyclomatic number
For a graph G let
Jochen Harant, Dieter Rautenbach, Peter Recht, Fri...