On the restriction of some NP-complete graph problems to permutation graphs

This publication has 11 references indexed in Scilit:

• Some simplified NP-complete graph problems
  Published by Elsevier ,2002
• Clustering and domination in perfect graphs
  Discrete Applied Mathematics, 1984
• The NP-completeness column: An ongoing guide
  Journal of Algorithms, 1984
• Transitive orientation in 0(n²) time
  Published by Association for Computing Machinery (ACM) ,1983
• Hamilton Paths in Grid Graphs
  SIAM Journal on Computing, 1982
• The NP-completeness column: An ongoing guide
  Journal of Algorithms, 1982
• The Bandwidth of Caterpillars with Hairs of Length 1 and 2
  SIAM Journal on Algebraic Discrete Methods, 1981
• An NP-hard problem in bipartite graphs
  ACM SIGACT News, 1975
• Permutation Graphs and Transitive Graphs
  Journal of the ACM, 1972
• Transitive Orientation of Graphs and Identification of Permutation Graphs
  Canadian Journal of Mathematics, 1971