On the relationship between NLC-width and linear NLC-width
Authors:
- Frank GurskiFrank Gurski
- Egon WankeEWEgon Wanke
- 1 November 2005
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 347 (1-2) , 76-89
Abstract
No abstract availableKeywords
This publication has 16 references indexed in Scilit:
- Edge dominating set and colorings on graphs with fixed clique-widthDiscrete Applied Mathematics, 2003
- ON THE CLIQUE-WIDTH OF SOME PERFECT GRAPH CLASSESInternational Journal of Foundations of Computer Science, 2000
- NLC2-DECOMPOSITION IN POLYNOMIAL TIMEInternational Journal of Foundations of Computer Science, 2000
- Upper bounds to the clique width of graphsDiscrete Applied Mathematics, 2000
- k-NLC graphs and polynomial algorithmsDiscrete Applied Mathematics, 1994
- Graph minors. II. Algorithmic aspects of tree-widthJournal of Algorithms, 1986
- A Linear Recognition Algorithm for CographsSIAM Journal on Computing, 1985
- Graph minors. I. Excluding a forestJournal of Combinatorial Theory, Series B, 1983
- Complement reducible graphsDiscrete Applied Mathematics, 1981
- On a property of the class of n-colorable graphsJournal of Combinatorial Theory, Series B, 1974