Packing disjoint cycles over vertex cuts
- 28 July 2010
- journal article
- Published by Elsevier in Discrete Mathematics
- Vol. 310 (13-14) , 1974-1978
Abstract
No abstract availableKeywords
This publication has 25 references indexed in Scilit:
- Approximation algorithms and hardness results for cycle packing problemsACM Transactions on Algorithms, 2007
- Recent Results on Disjoint Cycles in GraphsElectronic Notes in Discrete Mathematics, 2005
- Packing cycles in undirected graphsJournal of Algorithms, 2003
- Packing triangles in bounded degree graphsInformation Processing Letters, 2002
- On the Existence of Disjoint Cycles in a GraphCombinatorica, 1998
- Graph minors. II. Algorithmic aspects of tree-widthJournal of Algorithms, 1986
- A new proof and generalizations of a theorem of Erdős and Pósa on graphs withoutk+1 independent circuitsActa Mathematica Hungarica, 1967
- On Independent Circuits Contained in a GraphCanadian Journal of Mathematics, 1965
- On Edge-Disjoint Cycles in a GraphCanadian Mathematical Bulletin, 1964
- On the maximal number of independent circuits in a graphActa Mathematica Hungarica, 1963