Perfect Graphs

This publication has 34 references indexed in Scilit:

• Edmonds polytopes and a hierarchy of combinatorial problems
  Published by Elsevier ,2002
• Graphical properties related to minimal imperfection
  Discrete Mathematics, 1979
• Combinatorial designs related to the strong perfect graph conjecture
  Discrete Mathematics, 1979
• On line perfect graphs
  Mathematical Programming, 1978
• On the strong perfect graph conjecture
  Journal of Combinatorial Theory, Series B, 1976
• On certain polytopes associated with graphs
  Journal of Combinatorial Theory, Series B, 1975
• A sufficient condition for a matrix to be totally unimodular
  Networks, 1973
• Blocking and anti-blocking pairs of polyhedra
  Mathematical Programming, 1971
• Embedding Trees in the Rationals
  Proceedings of the National Academy of Sciences, 1970
• Maximum matching and a polyhedron with 0,1-vertices
  Journal of Research of the National Bureau of Standards Section B Mathematics and Mathematical Physics, 1965