Packing cycles through prescribed vertices
Authors:
- Naonori KakimuraNKNaonori Kakimura
- Ken-Ichi KawarabayashiKKKen-Ichi Kawarabayashi
- Dániel MarxDMDániel Marx
- 1 September 2011
- journal article
- research article
- Published by Elsevier in Journal of Combinatorial Theory, Series B
- Vol. 101 (5) , 378-381
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- On the odd-minor variant of Hadwiger's conjectureJournal of Combinatorial Theory, Series B, 2009
- Approximation algorithms and hardness results for cycle packing problemsACM Transactions on Algorithms, 2007
- Packing directed circuitsCombinatorica, 1996
- Graph Minors .XIII. The Disjoint Paths ProblemJournal of Combinatorial Theory, Series B, 1995
- On the presence of disjoint subgraphs of a specified typeJournal of Graph Theory, 1988
- Graph minors. V. Excluding a planar graphJournal of Combinatorial Theory, Series B, 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