Hamiltonian circuits in interval graph generalizations

This publication has 14 references indexed in Scilit:

• Finding Hamiltonian circuits in proper interval graphs
  Information Processing Letters, 1983
• Hamilton Paths in Grid Graphs
  SIAM Journal on Computing, 1982
• The NP-completeness column: An ongoing guide
  Journal of Algorithms, 1982
• The Hamiltonian Circuit Problem is Polynomial for 4-Connected Planar Graphs
  SIAM Journal on Computing, 1982
• The edge Hamiltonian path problem is NP-complete
  Information Processing Letters, 1981
• Extremal Values of the Interval Number of a Graph
  SIAM Journal on Algebraic Discrete Methods, 1980
• A recognition algorithm for the intersection graphs of paths in trees
  Discrete Mathematics, 1978
• The Planar Hamiltonian Circuit Problem is NP-Complete
  SIAM Journal on Computing, 1976
• A recognition algorithm for the intersection graphs of directed paths in directed trees
  Discrete Mathematics, 1975
• The intersection graphs of subtrees in trees are exactly the chordal graphs
  Journal of Combinatorial Theory, Series B, 1974