Discrete Applied Mathematics
Linear algorithm for optimal path cover problem on interval graphs
Information Processing Letters
Optimal path cover problem on block graphs and bipartite permutation graphs
Theoretical Computer Science
The path-partition problem in block graphs
Information Processing Letters
The $L(2,1)$-Labeling Problem on Graphs
SIAM Journal on Discrete Mathematics
Cardinality-restricted chains and antichains in partially ordered sets
Discrete Applied Mathematics - Special volume: first international colloquium on graphs and optimization (GOI), 1992
Hamiltonian circuits in chordal bipartite graphs
Discrete Mathematics
Discrete Applied Mathematics
Graph classes: a survey
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
On the k-path cover problem for cacti
Theoretical Computer Science
Proof that pyramid networks are 1-Hamiltonian-connected with high probability
Information Sciences: an International Journal
NP-completeness results for some problems on subclasses of bipartite and chordal graphs
Theoretical Computer Science
Approximation results for the weighted P4 partition problem
Journal of Discrete Algorithms
The Pk Partition Problem and Related Problems in Bipartite Graphs
SOFSEM '07 Proceedings of the 33rd conference on Current Trends in Theory and Practice of Computer Science
Necessary Condition for Path Partitioning Constraints
CPAIOR '07 Proceedings of the 4th international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Labeling bipartite permutation graphs with a condition at distance two
Discrete Applied Mathematics
Approximation results for the weighted P4 partition problems
FCT'05 Proceedings of the 15th international conference on Fundamentals of Computation Theory
The path partition problem and related problems in bipartite graphs
Operations Research Letters
On the complexity of the k-customer vehicle routing problem
Operations Research Letters
| Hi-index | 5.23 |
The k-path partition problem is to partition a graph into the minimum number of paths, so that none of them has length more than k, for a given positive integer k. The problem is a generalization of the Hamiltonian path problem and the problem of partitioning a graph into the minimum number of paths. The k-path partition problem remains NP-complete on the class of chordal bipartite graphs if k is part of the input, and we show that it is NP-complete on the class of comparability graphs even for k = 3. On the positive side, we present a polynomial-time solution for the problem, with any k, on bipartite permutation graphs, which form a subclass of chordal bipartite graphs.