Title of article :
On maximum cycle packings in polyhedral graphs
Author/Authors :
Recht, Peter Technische Universitt Dortmund - Operations Research und Wirtschaftsinformatik Sekretariat, Germany , Stehling, Stefan Rheinisch-Westfälisches Elektrizitätswerk Supply and Trading Gesellschaft mit beschränkter Haftung (RWE Supply Trading GmbH) - Risk Supply and Capacity, Germany
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.
Keywords :
Maximum cycle packing , polyhedral graphs , vertex , disjoint cycles , edge , disjoint cycle
Journal title :
Electronic Journal of Graph Theory and Applications (EJGTA)
Journal title :
Electronic Journal of Graph Theory and Applications (EJGTA)
