On packing shortest cycles in graphs

Rautenbach, Dieter GND; Regen, Friedrich GND

We study the problems to nd a maximum packing of shortest edge-disjoint cycles in a graph of given girth g (g-ESCP) and its vertex-disjoint analogue g-VSCP. In the case g = 3, Caprara and Rizzi (2001) have shown that g-ESCP can be solved in polynomial time for graphs with maximum degree 4, but is APX-hard for graphs with maximum degree 5, while g-VSCP can be solved in polynomial time for graphs with maximum degree 3, but is APX-hard for graphs with maximum degree 4. For g 2 f4; 5g, we show that both problems allow polynomial time algorithms for instances with maximum degree 3, but are APX-hard for instances with maximum degree 4. For each g \geq 6, both problems are APX-hard already for graphs with maximum degree 3.

Cite

Citation style:
Rautenbach Prof. Dr. rer. nat. habil., D., Regen Dipl.-Math., F., 2009. On packing shortest cycles in graphs. Preprint /  Technische Universität Ilmenau, Institut für Mathematik, Preprint /  Technische Universität Ilmenau, Institut für Mathematik 09–07.
Could not load citation form. Default citation form is displayed.

Rights

Use and reproduction:
All rights reserved

Export