Recognizing Dart-Free Perfect Graphs
From MaRDI portal
Publication:3149869
DOI10.1137/S0097539799354771zbMath1001.05061MaRDI QIDQ3149869
No author found.
Publication date: 29 September 2002
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Nonnumerical algorithms (68W05) Structural characterization of families of graphs (05C75) Perfect graphs (05C17)
Related Items (4)
Classes of perfect graphs ⋮ Square-free perfect graphs. ⋮ Maximum weight independent sets in odd-hole-free graphs without dart or without bull ⋮ Unnamed Item
This page was built for publication: Recognizing Dart-Free Perfect Graphs