Recognizing Dart-Free Perfect Graphs

DOI10.1137/S0097539799354771MaRDI QIDQ3149869zbMATH OpenFDO

Authors

Publication date 29 September 2002

Published in SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/S0097539799354771

zbMATH Keywords

perfect graphs

Mathematics Subject Classification ID

Perfect graphs (05C17) Structural characterization of families of graphs (05C75) Nonnumerical algorithms (68W05)

Recommendations

• scientific article; zbMATH DE number 1445285
• Recognizing claw-free perfect graphs
• Recognizing bull-free perfect graphs
• On dart-free perfectly contractile graphs
• Domatically perfect graphs
• A new characterization of perfect graphs
• scientific article; zbMATH DE number 1512683
• Recognition algorithm for diamond-free graphs
• Recognizing Perfect 2-Split Graphs
• scientific article; zbMATH DE number 4065042

Cited in

(10)

• Square-free perfect graphs.
• On dart-free perfectly contractile graphs
• Recognizing bull-free perfect graphs
• Classes of perfect graphs
• Recognizing Berge graphs
• scientific article; zbMATH DE number 1594510 (Why is no real title available?)
• scientific article; zbMATH DE number 1445285 (Why is no real title available?)
• Maximum weight independent sets in odd-hole-free graphs without dart or without bull
• A faster algorithm to recognize even-hole-free graphs
• On the structure of (dart, odd hole)-free graphs

This page was built for publication: Recognizing Dart-Free Perfect Graphs

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