Finding Hamiltonian circuits in interval graphs

This publication has 10 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 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
• Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
  Journal of Computer and System Sciences, 1976
• The Planar Hamiltonian Circuit Problem is NP-Complete
  SIAM Journal on Computing, 1976
• An NP-hard problem in bipartite graphs
  ACM SIGACT News, 1975
• A Characterization of Comparability Graphs and of Interval Graphs
  Canadian Journal of Mathematics, 1964
• Incidence matrices with the consecutive 1’s property
  Bulletin of the American Mathematical Society, 1964
• Representation of a finite graph by a set of intervals on the real line
  Fundamenta Mathematicae, 1962