Some simplified NP-complete graph problems

This publication has 14 references indexed in Scilit:

• Fast algorithms for bin packing
  Published by Elsevier ,2007
• Matching: A Well-Solved Class of Integer Linear Programs
  Published by Springer Nature ,2003
• Optimal Linear Ordering
  SIAM Journal on Applied Mathematics, 1973
• Planar 3-colorability is polynomial complete
  ACM SIGACT News, 1973
• Algorithms for a maximum clique and a maximum independent set of a circle graph
  Networks, 1973
• Complete register allocation problems
  Published by Association for Computing Machinery (ACM) ,1973
• Polynomial complete scheduling problems
  ACM SIGOPS Operating Systems Review, 1973
• Permutation Graphs and Transitive Graphs
  Journal of the ACM, 1972
• Algorithms for Minimum Coloring, Maximum Clique, Minimum Covering by Cliques, and Maximum Independent Set of a Chordal Graph
  SIAM Journal on Computing, 1972
• On colouring the nodes of a network
  Mathematical Proceedings of the Cambridge Philosophical Society, 1941