Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

9

DM
2010

favoriteEmaildiscussreport

83views more DM 2010»

Packing edge-disjoint cycles in graphs and the cyclomatic number

13 years 4 months ago

Packing edge-disjoint cycles in graphs and the cyclomatic number

Download www.tu-ilmenau.de

For a graph G let

Jochen Harant, Dieter Rautenbach, Peter Recht, Fri

Real-time Traffic

Cyclomatic Number | DM 2010 | Edge-disjoint Cycles | Maximum Number |

claim paper

Related Content

» Packing Edge Disjoint Triangles A Parameterized View

» On the resilience of Hamiltonicity and optimal packing of Hamilton cycles in random graphs

» Maximum cyclic 4cycle packings of the complete multipartite graph

» Exact and Approximation Algorithms for DNA Tag Set Design

Post Info
More Details (n/a)

Added	10 Dec 2010
Updated	10 Dec 2010
Type	Journal
Year	2010
Where	DM
Authors	Jochen Harant, Dieter Rautenbach, Peter Recht, Friedrich Regen

Comments (0)