On the k-path partition of graphs

Theoretical Computer Science

Volumn 290, Issue 3, 2003, Pages 2147-2155

  Steiner, George ^a  

^a MCMASTER UNIVERSITY   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

GRAPHIC METHODS; POLYNOMIAL APPROXIMATION; POLYNOMIALS;

BIPARTITE PERMUTATION GRAPHS; CHORDAL BIPARTITE GRAPH; COMPARABILITY GRAPHS; HAMILTONIAN PATH PROBLEMS; PARTITION PROBLEM; POLYNOMIAL-TIME; POSITIVE INTEGERS; POSITIVE SIDES;

GRAPH THEORY;

EID: 4544278109     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(02)00577-7     Document Type: Article

References (18)

1. [1] Arikati, S.R., Pandu Ragan, C., Linear algorithm for optimal path cover problem on interval graphs. Inform. Process. Lett. 35 (1990), 149–153.
2. [2] Bonucelli, M.A., Bovet, D.P., Minimum node disjoint path covering for circular arc graphs. Inform. Process. Lett. 8 (1979), 159–161.
3. [3] Brandstädt, A., Le, V.B., Spinrad, J.P., Graph Classes: A Survey, 1999, SIAM, Philadelphia, PA.
4. [4] Brandstädt, A., Spinrad, J., Stewart, L., Bipartite permutation graphs. Discrete Appl. Math. 18 (1987), 279–292.
5. [5] Chang, G.J., Kuo, D., The l(2,1)-labeling problem on graphs. SIAM J. Discrete Math. 9 (1996), 309–316.
6. [6] Damaschke, P., Deogun, J.S., Kratsch, D., Steiner, G., Finding hamiltonian paths in cocomparability graphs using the bump number algorithm. Order 8 (1992), 383–391.
7. [7] Garey, M.R., Johnson, D.S., Computers and Intractability: A Guide to the Theory of NP-Completeness, 1979, Freeman, New York.
8. [8] Golumbic, M.C., Algorithmic Graph Theory and Perfect Graphs, 1980, Academic Press, New York.
9. [9] S.E. Goodman, S.T. Hedetniemi, On the Hamiltonian Completion Problem, Springer, Berlin, 1973, pp. 262–272.
10. [10] Lin, R., Olariu, S., Pruesse, G., An optimal path cover algorithm for cographs. Comput. Math. Appl. 30 (1995), 75–83.
11. [11] Misra, J., Tarjan, R.E., Optimal chain partitions of trees. Inform. Process. Lett. 4 (1975), 24–26.
12. [12] Müller, H., Hamiltonian circuits in chordal bipartite graphs. Discrete Math. 156 (1996), 291–298.
13. [13] Shum, H., Trotter, L.E. Jr., Cardinality-restricted chains and antichains in partially ordered sets. Discrete Appl. Math. 65 (1996), 421–439.
14. [14] Z. Skupien, Path partitions of vertices and hamiltonicity of graphs, in: Proceedings of the Second Czechoslovakian Symposium on Graph Theory, Prague, 1974.
15. [15] Srikant, R., Sundaram, R., Singh, K.S., Pandu Ragan, C., Optimal path cover problem on block graphs and bipartite permutation graphs. Theoret. Comput. Sci. 115 (1993), 351–357.
16. [16] Steiner, G., On the k-path partition problem in cographs. Cong. Numer. 147 (2000), 89–96.
17. [17] Yan, J., Chang, G.J., Hedetniemi, S.M., Hedetniemi, S.T., k-path partitions in trees. Discrete Appl. Math. 78 (1997), 227–233.
18. [18] Yan, J.H., Chang, G.J., The path partition problem. Inform. Process. Lett. 52 (1994), 319–322.