Characterizations for restricted graphs of NLC-width 2
type: Item
instance of: scholarly article
title: Characterizations for restricted graphs of NLC-width 2
zbMATH Open document ID: 1108.68087
author: Frank Gurski
published in: Theoretical Computer Science
publication date: 2007-03-15T00:00:00Z
Mathematics Subject Classification ID: 68R10
zbMATH DE Number: 5134105
zbMATH Keywords: NLC-width
zbMATH Keywords: NLCT-width
zbMATH Keywords: linear NLC-width
zbMATH Keywords: graph characterizations
MaRDI profile type: Publication
full work available at URL: j.tcs.2006.12.010
OpenAlex ID: W2056940044
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: A Linear Recognition Algorithm for Cographs
cites work: Q4448752
cites work: Characterizations for co-graphs defined by restricted NLC-width or clique-width operations
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: NLC2-DECOMPOSITION IN POLYNOMIAL TIME
cites work: Graph minors. II. Algorithmic aspects of tree-width
cites work: \(k\)-NLC graphs and polynomial algorithms
DOI: 10.1016/J.TCS.2006.12.010
description: scientific article; zbMATH DE number 5134105