Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
9657702 | Theoretical Computer Science | 2005 | 14 Pages |
Abstract
In this paper, we consider NLC-width, NLCT-width, and linear NLC-width bounded graphs. We show that the set of all complete binary trees has unbounded linear NLC-width and that the set of all co-graphs has unbounded NLCT-width. Since trees have NLCT-width 3 and co-graphs have NLC-width 1, it follows that the family of linear NLC-width bounded graph classes is a proper subfamily of the family of NLCT-width bounded graph classes and that the family of NLCT-width bounded graph classes is a proper subfamily of the family of NLC-width bounded graph classes.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Frank Gurski, Egon Wanke,