Characterizations for co-graphs defined by restricted NLC-width or clique-width operations
type: Item
instance of: scholarly article
title: Characterizations for co-graphs defined by restricted NLC-width or clique-width operations
zbMATH Open document ID: 1085.05055
author: Frank Gurski
published in: Discrete Mathematics
publication date: 2006-03-29T00:00:00Z
Mathematics Subject Classification ID: 05C75
Mathematics Subject Classification ID: 05C17
Mathematics Subject Classification ID: 68R10
zbMATH DE Number: 5016265
zbMATH Keywords: NLCT-width
zbMATH Keywords: trivially perfect
zbMATH Keywords: threshold graphs
zbMATH Keywords: co-graphs
zbMATH Keywords: clique-width
MaRDI profile type: Publication
full work available at URL: j.disc.2005.11.014
OpenAlex ID: W1985956090
cites work: Graph Classes: A Survey
cites work: Q4165164
cites work: Complement reducible graphs
cites work: A Linear Recognition Algorithm for Cographs
cites work: Linear time solvable optimization problems on graphs of bounded clique-width
cites work: Upper bounds to the clique width of graphs
cites work: Q4448752
cites work: Trivially perfect graphs
cites work: LATIN 2004: Theoretical Informatics
cites work: Graph-Theoretic Concepts in Computer Science
cites work: On the relationship between NLC-width and linear NLC-width
cites work: Q3207000
cites work: NLC2-DECOMPOSITION IN POLYNOMIAL TIME
cites work: Edge dominating set and colorings on graphs with fixed clique-width
cites work: Threshold graphs and related topics
cites work: Approximating clique-width and branch-width
cites work: Dacey Graphs
cites work: \(k\)-NLC graphs and polynomial algorithms
cites work: The Comparability Graph of a Tree
DOI: 10.1016/J.DISC.2005.11.014
description: scientific article; zbMATH DE number 5016265