Characterizations for restricted graphs of NLC-width 2

DOI10.1016/J.TCS.2006.12.010zbMATH Open1108.68087OpenAlexW2056940044MaRDI QIDQ870845FDOQ870845

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

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

Cited In (2)

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

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)