Figure Index

FIG 1 K-TERMINAL GRAPH DIVISION
FIG 2 CUT-SET DIVISION
FIG 3 DIAMOND FIGURES
FIG 4 A LEFT MESH GRAPH
FIG 5 HAMILTONIAN SERIES-PARALLEL GRAPHS
FIG 6 ADDING ONE POINT TO A LEFT MESH GRAPH
FIG 7 DETERMINATION AND REMOVAL OF BRANCHES
FIG 8 K-TERMINAL POINTS IO
FIG 9 CUT-SET IO
FIG 10 A LEFT AND RIGHT SUBGRAPH OF THREE TERMINAL DIVISION
FIG 11 A SPARSE GRAPH
FIG 12 SERIES-PARALLEL CONTRADICTORY BRANCHES
FIG 13 PRIMITIVE LETTER GRAPHS
FIG 14 AN EXPERIMENTAL GRAPH AND A SHORT-CIRCUIT GRAPH
FIG 34 HAMILTONIAN EXPERIMENTATION CONCEPTUAL SCHEME

References

[GJ] M.R. Garey, D.S. Johnson, Computers and Intractability : A Guide to the Theory of NP-Completeness (Series of Books in the Mathematical Sciences), Bell Laboratories, W.H. Freeman and Company, 1979. http://www.amazon.com/exec/obidos/tg/detail/-/0716710455/002-0281401-5624077

[IPS] A. Itai, C. H. Papadimitriou, and J. L. Szwarcfiter. Hamilton paths in grid graphs. SIAM J. Comput., 11(4):676-686, 1982.

[SK] Skiena, S. "Grid Graphs." §4.2.4 in Implementing Discrete Mathematics: Combinatorics and Graph Theory with Mathematica. Reading, MA: Addison-Wesley, pp. 147-148, 1990.

4/15/96