edge-disjoint cycles

JCT
2010

158views more JCT 2010»

An asymptotic solution to the cycle decomposition problem for complete graphs

13 years 5 months ago

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

claim paper

Read More »

click to vote

DM
2010

83views more DM 2010»

Packing edge-disjoint cycles in graphs and the cyclomatic number

13 years 7 months ago

Download www.tu-ilmenau.de

For a graph G let

Jochen Harant, Dieter Rautenbach, Peter Recht, Fri...

claim paper

Read More »

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers