Recent developments on graphs of bounded clique-width

Authors:
Marcin Kamiński;Vadim V. Lozin;Martin Milanič
Affiliations:
Departement d'Informatique, Universite Libre de Bruxelles, O8.114, CP 212, Bvd. du Triomphe, 1050 Bruxelles, Belgium;DIMAP and Mathematics Institute, University of Warwick, Coventry CV4 7AL, UK;AG Genome Informatics, Faculty of Technology, Bielefeld University, Germany
Venue:
Discrete Applied Mathematics
Year:
2009

Citing 22
Cited 7

Graph minors. V. Excluding a planar graph

Journal of Combinatorial Theory Series B
Handle-rewriting hypergraph grammars

Journal of Computer and System Sciences
On the size of hereditary classes of graphs

Journal of Combinatorial Theory Series B
k-NLC graphs and polynomial algorithms

Discrete Applied Mathematics - Special issue: efficient algorithms and partial k-trees
Nonredundant 1's in $\Gamma$-Free Matrices

SIAM Journal on Discrete Mathematics
Treewidth for graphs with small chordality

Proceedings of the 4th Twente workshop on Graphs and combinatorial optimization
The expression of graph properties and graph transformations in monadic second-order logic

Handbook of graph grammars and computing by graph transformation
Upper bounds to the clique width of graphs

Discrete Applied Mathematics
Bipartite graphs without a skew star

Discrete Mathematics
Edge dominating set and colorings on graphs with fixed clique-width

Discrete Applied Mathematics
On the Clique-Width of Graphs in Hereditary Classes

ISAAC '02 Proceedings of the 13th International Symposium on Algorithms and Computation
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
Efficient robust algorithms for the maximum weight stable set problem in chair-free graph classes

Information Processing Letters
On the Band-, Tree-, and Clique-Width of Graphs with Bounded Vertex Degree

SIAM Journal on Discrete Mathematics
Chordal co-gem-free and (P5,gem)-freegraphs have bounded clique-width

Discrete Applied Mathematics - Structural decompositions, width parameters, and graph labelings (DAS 5)
On the Relationship Between Clique-Width and Treewidth

SIAM Journal on Computing
New Graph Classes of Bounded Clique-Width

Theory of Computing Systems
Rank-width and vertex-minors

Journal of Combinatorial Theory Series B
Clique-width minimization is NP-hard

Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Clique-Width for 4-Vertex Forbidden Subgraphs

Theory of Computing Systems
Approximating clique-width and branch-width

Journal of Combinatorial Theory Series B

The Maximum Independent Set Problem in Planar Graphs

MFCS '08 Proceedings of the 33rd international symposium on Mathematical Foundations of Computer Science
Compact labelings for efficient first-order model-checking

Journal of Combinatorial Optimization
Colouring vertices of triangle-free graphs

WG'10 Proceedings of the 36th international conference on Graph-theoretic concepts in computer science
Computing the Clique-width of large path powers in linear time via a new characterisation of clique-width

CSR'11 Proceedings of the 6th international conference on Computer science: theory and applications
F-rank-width of (edge-colored) graphs

CAI'11 Proceedings of the 4th international conference on Algebraic informatics
Clique-width and edge contraction

Information Processing Letters
Colouring of graphs with Ramsey-type forbidden subgraphs

Theoretical Computer Science

Quantified Score

Hi-index	0.05

Visualization

Abstract

Whether the clique-width of graphs in a certain class of graphs is bounded or not, is an important question from an algorithmic point of view, as many problems that are NP-hard in general admit polynomial-time solutions when restricted to graphs of bounded clique-width. Over the last few years, many classes of graphs have been shown to have bounded clique-width. For many others, this parameter has been proved to be unbounded. This paper provides a survey of recent results addressing this problem.