Electronic Journal of Graph Theory and Applications (EJGTA)
Vol 2, No 1 (2014): Electronic Journal of Graph Theory and Applications

On maximum cycle packings in polyhedral graphs

Peter Recht (Operations Research & Wirtschaftsinformatik Technische Universität Dortmund Vogelpothsweg 87 D 44221 Dortmund)
Stefan Stehling (RWE Supply & Trading GmbH Risk Supply and Capacity Altenessener Str. 27 45141 Essen)

Article Info

Publish Date
23 Apr 2014

Abstract

This paper addresses upper and lower bounds for the cardinality of a maximum vertex-/edge-disjoint 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.

Copyrights © 2014




Citation Download
RIS
EndNote, Reference Manager, ProCite
BibTex
Latex, Jabref
Original Source
Download Original
Google Scholar
Check in Google Scholar
Journal Info
Electronic Journal of Graph Theory and Applications (EJGTA)
Website

Abbrev

ejgta

Publisher

Indonesian Combinatorial Society

Subject

Electrical & Electronics Engineering

Description

The Electronic Journal of Graph Theory and Applications (EJGTA) is a refereed journal devoted to all areas of modern graph theory together with applications to other fields of mathematics, computer science and other sciences. The journal is published by the Indonesian Combinatorial Society ...