On the hamiltonian completion problem
Seymour E. Goodman, Stephen T. Hedetniemi · Lecture notes in mathematics · 1974
Cited by 46 works. doi:10.1007/bfb0066448
Authors
References
- Complexity of Computer Computations
- Reducibility Among Combinatorial Problems
- Graph Theory and Computing
- On covering the points of a graph with point disjoint paths
- EVOLUTION OF THE PATH NUMBER OF A GRAPH: COVERING AND PACKING IN GRAPHS, II††This research was supported in part by a grant to the Research Center for Group Dynamics of the University of Michigan from the NIH Biomedical Sciences Division.