Characterizations for co-graphs defined by restricted NLC-width or clique-width operations

DOI10.1016/j.disc.2005.11.014zbMath1085.05055MaRDI QIDQ819817

Frank Gurski

Publication date: 29 March 2006

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

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

zbMATH Keywords

clique-width; threshold graphs; co-graphs; NLCT-width; trivially perfect

Mathematics Subject Classification ID

68R10: Graph theory (including graph drawing) in computer science

05C75: Structural characterization of families of graphs

05C17: Perfect graphs