Recognizing Dart-Free Perfect Graphs

DOI10.1137/S0097539799354771zbMATH Open1001.05061MaRDI QIDQ3149869FDOQ3149869

Authors:

Publication date: 29 September 2002

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

Recommendations

• Publication:4952598
• 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
• Publication:4508370
• Recognition algorithm for diamond-free graphs
• Recognizing Perfect 2-Split Graphs
• scientific article; zbMATH DE number 4065042

zbMATH Keywords

perfect graphs

Mathematics Subject Classification ID

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

Cited In (9)

• On dart-free perfectly contractile graphs
• Title not available (Why is that?)
• A faster algorithm to recognize even-hole-free graphs
• Classes of perfect graphs
• Recognizing Berge graphs
• Recognizing bull-free perfect graphs
• Maximum weight independent sets in odd-hole-free graphs without dart or without bull
• Square-free perfect graphs.
• Title not available (Why is that?)

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)