S. E. Goodman
- 1 KARP, R.M. Reducibility among combinatorial problems. In Complexily of Computer Computatio~s, R. Miller and J. Thatcher, Eds., Plenum, New York, 1972, pp. 85-103.Google Scholar
- 2 KNUTH, D.E. Fundamenlal Algorilhms. Addison-Wesley, Reading, Mass., 1969, pp. 334-337.Google Scholar
- 3 BOESCH, F. T., CREN, S., AND McHu~H, J. A.M. On covering the points of a graph with point disjoint paths. In Graphs and Combinatorics, R. A. Bari and F. Harary, Eds., Springer-Verlag, Berlin, 1974, pp. 201-212.Google Scholar
- 4 GOODMAN, S., AND HEDETNIEMI, S. On the Hamiltonian completion problem. In Graphs and Combinatorics, R. A. Bari and F. Harary, Eds., Springer-Verlag, Berlin, 1974, pp. 262-272.Google Scholar
- 5 GOODMAN, S., AND HEDETNIEMI, S. A linear algorithm for the Hamiltonian completion problem for trees. (Submitted for publication.)Google Scholar
- 6 CHATY, G., AND CHEIN, M. Path-invariants in acircuit digraphs. Preprint, 1974.Google Scholar
- 7 GOODMAN, S., AND HEDETNIEMI, S. Eulerian walks in graphs. SIAM J. Comput. ~ (1973), 18-27.Google Scholar
- 8 GOODMAN, S., AND HEDETNIEMI, S. On Hamiltonian walks in graphs. SIAM J. Comput. $ (1974), 214-221.Google Scholar
- 9 HARARY, F., AND SCHWENK, A. Evolution of the path number of a graph, covering and packing in graphs, II. !n Graph Theory and Computing, R. C. Read, Ed., Academic Press, New York, 1972, pp. 39-45. RECEIVED DECEMBER 1973; REVISED OCTOBER 1974Google Scholar
Index Terms
- Advances on the Hamiltonian Completion Problem
Recommendations
Dirac's Hamiltonian and Bogoliubov's Hamiltonian as representation of the braid group
In this paper, it is shown that Dirac's Hamiltonian and Bogoliubov's Hamiltonian both can be braid group matrix representations which are new type of four-dimensional matrix representation of the braid group in comparison with the well-known type (Ge et ...
Comments