Characterizations for restricted graphs of NLC-width 2

DOI10.1016/j.tcs.2006.12.010zbMath1108.68087OpenAlexW2056940044MaRDI QIDQ870845

Frank Gurski

Publication date: 15 March 2007

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2006.12.010

zbMATH Keywords

NLC-widthNLCT-widthgraph characterizationslinear NLC-width

Mathematics Subject Classification ID

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

Related Items (2)

Well-quasi-order of relabel functions ⋮ Clique-width of graphs defined by one-vertex extensions

Cites Work

• Unnamed Item
• Characterizations for co-graphs defined by restricted NLC-width or clique-width operations
• \(k\)-NLC graphs and polynomial algorithms
• Linear time solvable optimization problems on graphs of bounded clique-width
• Upper bounds to the clique width of graphs
• On the relationship between NLC-width and linear NLC-width
• A Linear Recognition Algorithm for Cographs
• Graph minors. II. Algorithmic aspects of tree-width
• NLC₂-DECOMPOSITION IN POLYNOMIAL TIME
• Graph-Theoretic Concepts in Computer Science
• LATIN 2004: Theoretical Informatics

This page was built for publication: Characterizations for restricted graphs of NLC-width 2