Optimal Hamiltonian completions and path covers for trees, and a reduction to maximum flow

ANZIAM Journal

Volumn 44, Issue 2, 2002, Pages 193-204

  Franzblau, D S ^a   Raychaudhuri, A ^a  

^a CITY UNIVERSITY OF NEW YORK   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 33747151282     PISSN: 14461811     EISSN: None     Source Type: Journal    
DOI: 10.1017/S1446181100013894     Document Type: Article

References (17)

1. F. T. Boesch, S. Chen and N. A. M. McHugh, "On covering the points of a graph with point disjoint paths", in Graphs and combinatorics (eds. A. Dold and B. Eckman), Lecture Notes in Math. 406, (Springer, Berlin, 1974) 201-212.
2. F. T. Boesch and J. F. Gimpel, "Covering the points of a digraph with point-disjoint paths and its application to code optimization", JACM 24 (1977) 192-198.
3. J. A. Bondy and U. S. R. Murty, Graph theory with applications (North Holland, NY, 1976).
4. R. Diestel, Graph theory (Springer, NY, 1997).
5. L. R. Ford and D. R Fulkerson, "A simple algorithm for finding maximal network flows and an application to the Hitchcock problem", Canadian J. Math. 9 (1957) 210-218.
6. S. E. Goodman and S. T. Hedetniemi, "On the Hamiltonian completion problem", in Graphs and combinatorics (eds. A. Dold and B. Eckman), Lecture Notes in Math. 406, (Springer, Berlin, 1974) 262-272.
7. S. E. Goodman, S. T. Hedetniemi and P. J. Slater, "Advances on the Hamiltonian completion problem", JACM 22 (1975) 352-360.
8. W. K. Hale, "Frequency assignment: Theory and applications", Proc. IEEE 68 (1980) 1497-1514.
9. Z. A. Karejan and K. M. Mosesjan, "The Hamiltonian completion number of a digraph", Akad. Nauk Armyan. SSR Dokl. 70 (1980) 129-132 (in Russian).
10. N. M. Komienko, "The Hamiltonian completion of some classes of graphs", VestsīAkad. Navuk BSSR, Ser. Fiz.-Mat. Navuk 124 (1982) 18-22 (in Russian).
11. S. Kundu, "A linear algorithm for the Hamiltonian completion number of a tree", Info. Proc. Letters 5 (1976) 55-57.
12. E. L. Lawler, Combinatorial optimization: Networks and matroids (Holt, Rinehart, and Winston, NY, 1976).
13. S. Moran and Y. Wolfstahl, "Optimal covering of cacti by vertex-disjoint paths", Theoret. Comp. Sci. 84 (1991) 179-197.
14. S.S. Pinter and Y. Wolfstahl, "On mapping processes to processors in distributed systems", Internat. J. Parallel Prog. 16 (1987) 1-15.
15. A. Raychaudhuri, "Intersection assignments, T-colorings, and powers of graphs". Ph. D. Thesis, Rutgers Univ., 1985.
16. F. S. Roberts, Applied combinatorics (Prentice-Hall, Englewood Cliffs, NJ, 1984).
17. A. Tucker, Applied combinatorics (Wiley, NY, 1980).