On packing shortest cycles in graphs
Authors:
- Dieter RautenbachDRDieter Rautenbach
- Friedrich RegenFRFriedrich Regen
- 30 June 2009
- journal article
- research article
- Published by Elsevier in Information Processing Letters
- Vol. 109 (14) , 816-821
Abstract
No abstract availableKeywords
This publication has 3 references indexed in Scilit:
- Packing triangles in bounded degree graphsInformation Processing Letters, 2002
- The NP-Completeness of Some Edge-Partition ProblemsSIAM Journal on Computing, 1981
- On maximal independent sets of vertices in claw-free graphsJournal of Combinatorial Theory, Series B, 1980