A note on disjoint cycles

Authors:
Michal Kotrbčík
Affiliations:
Department of Computer Science, Comenius University, 842 48 Bratislava, Slovakia
Venue:
Information Processing Letters
Year:
2012

Citing 9
Cited 0

Topological graph theory

Topological graph theory
Finding a maximum-genus graph imbedding

Journal of the ACM (JACM)
The maximum genus of graphs of diameter two

Discrete Mathematics
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
New Algorithms for k-Face Cover, k-Feedback Vertex Set, and k -Disjoint Cycles on Plane and Planar Graphs

WG '02 Revised Papers from the 28th International Workshop on Graph-Theoretic Concepts in Computer Science
On Disjoint Cycles

WG '91 Proceedings of the 17th International Workshop
Packing cycles in undirected graphs

Journal of Algorithms - Special issue: Twelfth annual ACM-SIAM symposium on discrete algorithms
Approximation algorithms and hardness results for cycle packing problems

ACM Transactions on Algorithms (TALG)
Approximability of Packing Disjoint Cycles

Algorithmica

Quantified Score

Hi-index	0.89

Visualization

Abstract

We prove tight polynomial-time computable lower and upper bounds on the maximum number of vertex-disjoint cycles of a given graph in terms of its cycle rank and maximum genus.