Overview Statistic: PDF-Downloads (blue) and Frontdoor-Views (gray)

My Favorite Theorem: Characterizations of Perfect Graphs

Please always quote using this URN: urn:nbn:de:0297-zib-4053
  • This paper summarizes and discusses various characterizations of perfect graphs and mentions some open problems in this area.

Download full text files

Export metadata

Additional Services

Share in Twitter Search Google Scholar Statistics - number of accesses to the document
Metadaten
Author:Martin Grötschel
Document Type:ZIB-Report
Tag:graph theory; integer programming; perfect graphs
MSC-Classification:05-XX COMBINATORICS (For finite fields, see 11Txx) / 05Cxx Graph theory (For applications of graphs, see 68R10, 81Q30, 81T15, 82B20, 82C20, 90C35, 92E10, 94C15) / 05C15 Coloring of graphs and hypergraphs
05-XX COMBINATORICS (For finite fields, see 11Txx) / 05Cxx Graph theory (For applications of graphs, see 68R10, 81Q30, 81T15, 82B20, 82C20, 90C35, 92E10, 94C15) / 05C35 Extremal problems [See also 90C35]
05-XX COMBINATORICS (For finite fields, see 11Txx) / 05Cxx Graph theory (For applications of graphs, see 68R10, 81Q30, 81T15, 82B20, 82C20, 90C35, 92E10, 94C15) / 05C75 Structural characterization of families of graphs
90-XX OPERATIONS RESEARCH, MATHEMATICAL PROGRAMMING / 90Cxx Mathematical programming [See also 49Mxx, 65Kxx] / 90C10 Integer programming
90-XX OPERATIONS RESEARCH, MATHEMATICAL PROGRAMMING / 90Cxx Mathematical programming [See also 49Mxx, 65Kxx] / 90C27 Combinatorial optimization
Date of first Publication:1999/06/11
Series (Serial Number):ZIB-Report (SC-99-17)
ZIB-Reportnumber:SC-99-17
Published in:Appeared in: OPTIMA-Mathematical Programming Society Newsletter 62 (1999) 2-5
Accept ✔
Diese Webseite verwendet technisch erforderliche Session-Cookies. Durch die weitere Nutzung der Webseite stimmen Sie diesem zu. Unsere Datenschutzerklärung finden Sie hier.