Algorithmic Aspects of Perfect Graphs

This publication has 17 references indexed in Scilit:

• The ellipsoid method and its consequences in combinatorial optimization
  Combinatorica, 1981
• The complexity of comparability graph recognition and coloring
  Computing, 1977
• Comparability graphs and a new matroid
  Journal of Combinatorial Theory, Series B, 1977
• Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
  Journal of Computer and System Sciences, 1976
• Algorithms for a maximum clique and a maximum independent set of a circle graph
  Networks, 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
• Incidence matrices and interval graphs
  Pacific Journal of Mathematics, 1965
• A Characterization of Comparability Graphs and of Interval Graphs
  Canadian Journal of Mathematics, 1964
• On rigid circuit graphs
  Abhandlungen aus dem Mathematischen Seminar der Universitat Hamburg, 1961