k-NLC graphs and polynomial algorithms
Discrete Applied Mathematics - Special issue: efficient algorithms and partial k-trees
Graph classes: a survey
Upper bounds to the clique width of graphs
Discrete Applied Mathematics
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Edge dominating set and colorings on graphs with fixed clique-width
Discrete Applied Mathematics
Polynomial Time Recognition of Clique-Width \le \leq 3 Graphs (Extended Abstract)
LATIN '00 Proceedings of the 4th Latin American Symposium on Theoretical Informatics
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
New Graph Classes of Bounded Clique-Width
WG '02 Revised Papers from the 28th International Workshop on Graph-Theoretic Concepts in Computer Science
Clique-width minimization is NP-hard
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Note: Characterizations for restricted graphs of NLC-width 2
Theoretical Computer Science
The relative clique-width of a graph
Journal of Combinatorial Theory Series B
Graph parameters measuring neighbourhoods in graphs-Bounds and applications
Discrete Applied Mathematics
The NLC-width and clique-width for powers of graphs of bounded tree-width
Discrete Applied Mathematics
A Complete Characterisation of the Linear Clique-Width of Path Powers
TAMC '09 Proceedings of the 6th Annual Conference on Theory and Applications of Models of Computation
On a disparity between relative cliquewidth and relative NLC-width
Discrete Applied Mathematics
Graphs of linear clique-width at most 3
TAMC'08 Proceedings of the 5th international conference on Theory and applications of models of computation
Linear recurrence relations for graph polynomials
Pillars of computer science
Minimizing nLC-width is nP-complete
WG'05 Proceedings of the 31st international conference on Graph-Theoretic Concepts in Computer Science
Characterising the linear clique-width of a class of graphs by forbidden induced subgraphs
Discrete Applied Mathematics
| Hi-index | 5.23 |
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.