| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 438457 | Theoretical Computer Science | 2007 | 7 Pages |
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.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
