scientific article; zbMATH DE number 1445285

MaRDI QIDQ4952598zbMATH OpenFDO

Authors

Publication date 10 May 2000

zbMATH Keywords

chromatic numbercycledart-free Berge graphsperfect graphspolynomial-time algorithm

Mathematics Subject Classification ID

Perfect graphs (05C17) Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Recognizing Dart-Free Perfect Graphs
• Bull-free Berge graphs are perfect
• Two classes of perfect graphs
• On dart-free perfectly contractile graphs
• Recognizing Berge graphs

Cited in

(4)

• Quasi-star-cutsets and some consequences
• On dart-free perfectly contractile graphs
• Recognizing bull-free perfect graphs
• Recognizing Dart-Free Perfect Graphs

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4952598)