An approximation algorithm for maximum \(P_{3}\)-packing in subcubic graphs
type: Item
instance of: scholarly article
title: An approximation algorithm for maximum \(P_{3}\)-packing in subcubic graphs
zbMATH Open document ID: 1184.05124
author: Adrian Kosowski
author: Michal Malafiejski
author: Paweł Żyliński
published in: Information Processing Letters
publication date: 2010-01-29T00:00:00Z
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 05C38
Mathematics Subject Classification ID: 68W25
Mathematics Subject Classification ID: 68R10
zbMATH DE Number: 5664491
zbMATH Keywords: approximation algorithms
zbMATH Keywords: path factor
zbMATH Keywords: subcubic graph
MaRDI profile type: Publication
full work available at URL: j.ipl.2006.05.003
OpenAlex ID: W2203084993
cites work: Factors and factorizations of graphs—a survey
cites work: Generalized planar matching
cites work: Approximation algorithms for the test cover problem
cites work: An approximation algorithm for maximum packing of 3-edge paths
cites work: On the Complexity of General Graph Factor Problems
cites work: On packing 3-vertex paths in a graph
cites work: Path factors in cubic graphs
cites work: How many disjoint 2-edge paths must a cubic graph have?
cites work: Parallel Processing and Applied Mathematics
cites work: Chain packing in graphs
cites work: On gallery watchmen in grids
DOI: 10.1016/J.IPL.2006.05.003
description: scientific article; zbMATH DE number 5664491