Graphs of linear clique-width at most 3

Authors:
Pinar Heggernes;Daniel Meister;Charis Papadopoulos
Affiliations:
Department of Informatics, University of Bergen, Bergen, Norway;Department of Informatics, University of Bergen, Bergen, Norway;Department of Informatics, University of Bergen, Bergen, Norway
Venue:
TAMC'08 Proceedings of the 5th international conference on Theory and applications of models of computation
Year:
2008

Citing 8
Cited 3

Domination on cocomparability graphs

SIAM Journal on Discrete Mathematics
Handle-rewriting hypergraph grammars

Journal of Computer and System Sciences
Graph classes: a survey

Graph classes: a survey
Upper bounds to the clique width of graphs

Discrete Applied Mathematics
Polynomial Time Recognition of Clique-Width \le \leq 3 Graphs (Extended Abstract)

LATIN '00 Proceedings of the 4th Latin American Symposium on Theoretical Informatics
Clique-width minimization is NP-hard

Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
On the relationship between NLC-width and linear NLC-width

Theoretical Computer Science
Width Parameters Beyond Tree-width and their Applications

The Computer Journal

A Complete Characterisation of the Linear Clique-Width of Path Powers

TAMC '09 Proceedings of the 6th Annual Conference on Theory and Applications of Models of Computation
On a disparity between relative cliquewidth and relative NLC-width

Discrete Applied Mathematics
Characterising the linear clique-width of a class of graphs by forbidden induced subgraphs

Discrete Applied Mathematics

Quantified Score

Hi-index	0.00

Visualization

Abstract

We give the first characterisation of graphs of linear cliquewidth at most 3, and we give a polynomial-time recognition algorithm for such graphs.