Approximate min-max relations on plane graphs

Jie Ma, Xingxing Yu and Wenan Zang ()
Additional contact information
Jie Ma: Georgia Institute of Technology
Xingxing Yu: Georgia Institute of Technology
Wenan Zang: The University of Hong Kong

Journal of Combinatorial Optimization, 2013, vol. 26, issue 1, No 10, 127-134

Abstract: Abstract Let G be a plane graph, let τ(G) (resp. τ′(G)) be the minimum number of vertices (resp. edges) that meet all cycles of G, and let ν(G) (resp. ν′(G)) be the maximum number of vertex-disjoint (resp. edge-disjoint) cycles in G. In this note we show that τ(G)≤3ν(G) and τ′(G)≤4ν′(G)−1; our proofs are constructive, which yield polynomial-time algorithms for finding corresponding objects with the desired properties.

Keywords: Plane graph; Feedback set; Cycle; Approximate min-max relation (search for similar items in EconPapers)
Date: 2013
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10878-011-9440-0 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:26:y:2013:i:1:d:10.1007_s10878-011-9440-0

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1007/s10878-011-9440-0

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().