Clique-width of graphs defined by one-vertex extensions
Author:
- Michaël RaoMRMichaël Rao
- 1 December 2008
- journal article
- research article
- Published by Elsevier in Discrete Mathematics
- Vol. 308 (24) , 6157-6165
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- Characterizations for restricted graphs of NLC-width 2Theoretical Computer Science, 2007
- Approximating clique-width and branch-widthJournal of Combinatorial Theory, Series B, 2006
- k-NLC graphs and polynomial algorithmsDiscrete Applied Mathematics, 1994
- Handle-rewriting hypergraph grammarsJournal of Computer and System Sciences, 1993
- Completely separable graphsDiscrete Applied Mathematics, 1990
- Distance-hereditary graphsJournal of Combinatorial Theory, Series B, 1986
- Graph minors. II. Algorithmic aspects of tree-widthJournal of Algorithms, 1986
- Complement reducible graphsDiscrete Applied Mathematics, 1981
- Graphs indecomposable with respect to the X-joinDiscrete Mathematics, 1973
- Transitiv orientierbare GraphenActa Mathematica Hungarica, 1967