Packing paths perfectly
type: Item
instance of: scholarly article
title: Packing paths perfectly
zbMATH Open document ID: 0723.05092
DOI: 10.1016/0012-365X(90)90382-R
author: Jin Akiyama
author: Vašek Chvátal
published in: Discrete Mathematics
publication date: 1990-01-01T00:00:00Z
review text: A class of graphs is characterized in which the largest number of vertex- disjoint paths of length two can be found in polynomial time. Membership in this class can be tested in polynomial time.
Mathematics Subject Classification ID: 05C70
Mathematics Subject Classification ID: 05C38
zbMATH DE Number: 4191720
zbMATH Keywords: algorithm
zbMATH Keywords: largest number of vertex-disjoint paths
MaRDI profile type: Publication
cites work: Q5184946
cites work: Paths, Trees, and Flowers
cites work: Q3216686
cites work: Q3929772
cites work: On the completeness of a generalized matching problem
cites work: On the Complexity of General Graph Factor Problems
cites work: Line perfect graphs
cites work: Q3686753
description: scientific article; zbMATH DE number 4191720