Journal of Combinatorial Theory Series B
A tree representation for P4-sparse graphs
Discrete Applied Mathematics
Handle-rewriting hypergraph grammars
Journal of Computer and System Sciences
A decomposition for a class of &parl0;P5,P5&parr0;- free graphs
Discrete Mathematics
Discrete Mathematics
Proceedings of an international symposium on Graphs and combinatorics
Graph classes: a survey
Upper bounds to the clique width of graphs
Discrete Applied Mathematics
Conic reduction of graphs for the stable set problem
Discrete Mathematics
Linear Time Solvable Optimization Problems on Graphs of Bounded Clique Width
WG '98 Proceedings of the 24th International Workshop on Graph-Theoretic Concepts in Computer Science
On the structure and stability number of P5- and co-chair-free graphs
Discrete Applied Mathematics - Special issue on stability in graphs and related topics
Stability number of bull- and chair-free graphs revisited
Discrete Applied Mathematics
(P5,diamond)-free graphs revisited: structure and linear time optimization
Discrete Applied Mathematics
Structure and stability number of chair-, co-P- and gem-free graphs revisited
Information Processing Letters
On the structure and stability number of P5- and co-chair-free graphs
Discrete Applied Mathematics - Special issue on stability in graphs and related topics
(P5,diamond)-free graphs revisited: structure and linear time optimization
Discrete Applied Mathematics - Optimal discrete structure and algorithms (ODSA 2000)
On the relationship between NLC-width and linear NLC-width
Theoretical Computer Science
Vertex disjoint paths on clique-width bounded graphs
Theoretical Computer Science
(P5,diamond)-free graphs revisited: structure and linear time optimization
Discrete Applied Mathematics
Clique-width for four-vertex forbidden subgraphs
FCT'05 Proceedings of the 15th international conference on Fundamentals of Computation Theory
| Hi-index | 0.00 |
Clique-width of graphs is a major new concept with respect to efficiency of graph algorithms; it is known that every algorithmic problem expressible in a certain kind of Monadic Second Order Logic called LinEMSOL(驴1,L) by Courcelle, Makowsky and Rotics, is solvable in linear time on any graph class with bounded clique-width for which a k-expression for the input graph can be constructed in linear time. The concept of clique-width extends the one of treewidth since bounded treewidth implies bounded clique-width.We give a complete classification of all graph classes defined by forbidden one-vertex extensions of the P4 with respect to their clique-width. Our results extend and improve recently published structural and complexity results in a systematic way.