Note: Characterizations for restricted graphs of NLC-width 2

Authors:
Frank Gurski
Affiliations:
Heinrich-Heine-Universität Düsseldorf, Institute of Computer Science, D-40225 Düsseldorf, Germany
Venue:
Theoretical Computer Science
Year:
2007

Citing 5
Cited 0

k-NLC graphs and polynomial algorithms

Discrete Applied Mathematics - Special issue: efficient algorithms and partial k-trees
Upper bounds to the clique width of graphs

Discrete Applied Mathematics
How to Solve NP-hard Graph Problems on Clique-Width Bounded Graphs in Polynomial Time

WG '01 Proceedings of the 27th International Workshop on Graph-Theoretic Concepts in Computer Science
On the relationship between NLC-width and linear NLC-width

Theoretical Computer Science
Minimizing nLC-width is nP-complete

WG'05 Proceedings of the 31st international conference on Graph-Theoretic Concepts in Computer Science

Quantified Score

Hi-index	5.23

Visualization

Abstract

In this paper we give a finite forbidden subgraph characterization of graphs defined by NLC-width 2-expressions, by NLCT-width 2-expressions, or by linear NLC-width 2-expressions that have tree-width 1.