On maximum cycle packings in polyhedral graphs

Abstract

This paper addresses upper and lower bounds for the cardinality of a maximum vertex-/edgedisjoint cycle packing in a polyhedral graph G. Bounds on the cardinality of such packings are provided, that depend on the size, the order or the number of faces of G, respectively. Polyhedral graphs are constructed, that attain these bounds.

Maximum cycle packing using SPR-trees

“…Packing edge-disjoint cycles in graphs is a classical graph-theoretical problem. There is a large amount of literature concerning cycle packing problems for example [12], [11], [10], [1], [20], [7], [6], [19], [18]. In [14], [2] and [8] simple approximation algorithms are described since cycle packing problems are typically hard [14].…”

A Dynamic Programming Approach for the Max-Min Cycle Packing Problem in Even Graphs

“…In [13] bounds on ( ) G ν are presented if G is a polyhedral graph. These bounds depend on the size, the order or the number of faces of G, respectively.…”