On packing shortest cycles in graphs
type: Item
instance of: scholarly article
title: On packing shortest cycles in graphs
zbMATH Open document ID: 1197.05119
author: Dieter Rautenbach
author: Friedrich Regen
published in: Information Processing Letters
publication date: 2010-08-20T00:00:00Z
Mathematics Subject Classification ID: 05C70
Mathematics Subject Classification ID: 05C38
Mathematics Subject Classification ID: 68W25
zbMATH DE Number: 5773804
zbMATH Keywords: algorithms
zbMATH Keywords: approximation algorithms
zbMATH Keywords: combinatorial problems
zbMATH Keywords: graph algorithms
zbMATH Keywords: shortest cycles
zbMATH Keywords: packing
zbMATH Keywords: complexity
MaRDI profile type: Publication
full work available at URL: j.ipl.2009.04.001
OpenAlex ID: W2159067821
cites work: Packing triangles in bounded degree graphs.
cites work: Q4198056
cites work: The NP-Completeness of Some Edge-Partition Problems
cites work: Q4142699
cites work: On maximal independent sets of vertices in claw-free graphs
DOI: 10.1016/J.IPL.2009.04.001
description: scientific article; zbMATH DE number 5773804