Characterizations for restricted graphs of NLC-width 2

DOI10.1016/J.TCS.2006.12.010MaRDI QIDQ870845zbMATH OpenOpenAlexFDO

Authors 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)

Cites work

• scientific article; zbMATH DE number 2044928 (Why is no real title available?)
• A Linear Recognition Algorithm for Cographs
• Characterizations for co-graphs defined by restricted NLC-width or clique-width operations
• Graph minors. II. Algorithmic aspects of tree-width
• Graph-Theoretic Concepts in Computer Science
• LATIN 2004: Theoretical Informatics
• Linear time solvable optimization problems on graphs of bounded clique-width
• NLC\(_{2}\)-decomposition in polynomial time
• On the relationship between NLC-width and linear NLC-width
• Upper bounds to the clique width of graphs
• \(k\)-NLC graphs and polynomial algorithms

Cited in

(2)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q870845)