Partial characterizations of clique-perfect graphs II: Diamond-free and Helly circular-arc graphs

DOI10.1016/j.disc.2007.12.054zbMath1227.05151MaRDI QIDQ1025541

Maria Chudnovsky, Guillermo Durán, Flavia Bonomo-Braberman

Publication date: 19 June 2009

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2007.12.054

zbMATH Keywords

perfect graphs; diamond-free graphs; Helly circular-arc graphs; clique-perfect graphs; k-perfect graphs

Mathematics Subject Classification ID

05C75: Structural characterization of families of graphs

05C69: Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.)

05C17: Perfect graphs