Distance-hereditary graphs, Steiner trees, and connected domination
SIAM Journal on Computing
Discrete Applied Mathematics - Computational combinatiorics
Handle-rewriting hypergraph grammars
Journal of Computer and System Sciences
Upper bounds to the clique width of graphs
Discrete Applied Mathematics
Discrete Applied Mathematics - Special issue on international workshop of graph-theoretic concepts in computer science WG'98 conference selected papers
Dominating Cliques in Distance-Hereditary Graphs
SWAT '94 Proceedings of the 4th Scandinavian Workshop on Algorithm Theory
LexBFS-Orderings and Power of Graphs
WG '96 Proceedings of the 22nd International Workshop on Graph-Theoretic Concepts in Computer Science
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
Algorithmic Graph Theory and Perfect Graphs (Annals of Discrete Mathematics, Vol 57)
Algorithmic Graph Theory and Perfect Graphs (Annals of Discrete Mathematics, Vol 57)
Restricted unimodular chordal graphs
Journal of Graph Theory
Efficient Algorithms for the Hamiltonian Problem on Distance-Hereditary Graphs
COCOON '02 Proceedings of the 8th Annual International Conference on Computing and Combinatorics
The Tree-Width of Clique-Width Bounded Graphs Without Kn, n
WG '00 Proceedings of the 26th International Workshop on Graph-Theoretic Concepts in Computer Science
log n-Approximative NLCk-Decomposition in O(n2k+1) Time
WG '01 Proceedings of the 27th International Workshop on Graph-Theoretic Concepts in Computer Science
On Robust Algorithms for the Maximum Weight Stable Set Problem
FCT '01 Proceedings of the 13th International Symposium on Fundamentals of Computation Theory
Collective tree spanners in graphs with bounded genus, chordality, tree-width, or clique-width
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
Solving #SAT using vertex covers
SAT'06 Proceedings of the 9th international conference on Theory and Applications of Satisfiability Testing
Graph classes with structured neighborhoods and algorithmic applications
WG'11 Proceedings of the 37th international conference on Graph-Theoretic Concepts in Computer Science
Note: Computing maximum stable sets for distance-hereditary graphs
Discrete Optimization
A SAT approach to clique-width
SAT'13 Proceedings of the 16th international conference on Theory and Applications of Satisfiability Testing
| Hi-index | 0.00 |
Graphs of clique-width at most k were introduced by Courcelle, Engelfriet and Rozenberg (1993) as graphs which can be defined by k-expressions based on graph operations which use k vertex labels. In this paper we study the clique-width of perfect graph classes. On one hand, we show that every distance-hereditary graph, has clique-width at most 3, and a 3-expression defining it can be obtained in linear time. On the other hand, we show that the classes of unit interval and permutation graphs are not of bounded clique-width. More precisely, w e show that for every n ∈ N there is a unit interval graph In and a permutation graph Hn having n2 vertices, each of whose clique-width is exactly n+1. These results allowus to see the borderwithin the hierarchy of perfect graphs between classes whose clique-width is bounded and classes whose clique-width is unbounded. Finally we show that every n×n square grid, n ∈ N, n ≥ 3, has clique-width exactly n + 1.