On a relation between \(k\)-path partition and \(k\)-path vertex cover
type: Item
instance of: scholarly article
title: On a relation between \(k\)-path partition and \(k\)-path vertex cover
zbMATH Open document ID: 1464.05304
author: Christoph Brause
author: R. Krivoš-Belluš
published in: Discrete Applied Mathematics
publication date: 2021-06-07T00:00:00Z
Mathematics Subject Classification ID: 05C70
Mathematics Subject Classification ID: 68Q17
Mathematics Subject Classification ID: 90C27
zbMATH DE Number: 7355965
zbMATH Keywords: \(k\)-path partition
zbMATH Keywords: \(k\)-path vertex cover
zbMATH Keywords: forbidden subgraphs
MaRDI profile type: Publication
full work available at URL: j.dam.2017.01.013
OpenAlex ID: W2592808588
cites work: Characterizations of derived graphs
cites work: A Better Bound on the Variance
cites work: Q5463498
cites work: On the vertex \(k\)-path cover
cites work: Minimum \(k\)-path vertex cover
cites work: Q4198056
cites work: The \(k\)-path vertex cover of rooted product graphs
cites work: On the \(k\)-path vertex cover of some graph products
cites work: On computing the minimum 3-path vertex cover and dissociation number of graphs
cites work: Independent Set in P5-Free Graphs in Polynomial Time
cites work: Some results on graphs without long induced paths
cites work: The path partition problem and related problems in bipartite graphs
cites work: Vertex packings: Structural properties and algorithms
cites work: The complexity of dissociation set problems in graphs
cites work: An FPT algorithm for the vertex cover \(P_4\) problem
cites work: A factor \(2\) approximation algorithm for the vertex cover \(P_3\) problem
cites work: A primal-dual approximation algorithm for the vertex cover \(P^3\) problem
cites work: \(k\)-path partitions in trees
DOI: 10.1016/J.DAM.2017.01.013
Recommended article: On the vertex \(k\)-path cover
Recommended article: On the \(k\)-path partition problem in cographs
Recommended article: On the \(k\)-path vertex cover of some graph products
Recommended article: The \(k\)-path vertex cover in Cartesian product graphs and complete bipartite graphs
Recommended article: On the \(k\)-path partition of graphs.
Recommended article: Q3615803
Recommended article: The k‐path vertex cover: General bounds and chordal graphs
Recommended article: The path partition problem and related problems in bipartite graphs
Recommended article: The P k Partition Problem and Related Problems in Bipartite Graphs
Recommended article: On the weighted \(k\)-path vertex cover problem
description: scientific article; zbMATH DE number 7355965