Skip to main content
Conference Proceedings

On the clique-width of graphs in hereditary classes

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2002) 2518 LNCS 44-54
DOI: 10.1007/3-540-36136-7_5
48Citations
Citations of this article
8Readers
Mendeley users who have this article in their library.
Get full text

Abstract

The paper presents several results that can be helpful for deciding whether the clique-width of graphs in a certain class is bounded or not, and applies these results to a number of particular graph classes. © Springer-Verlag Berlin Heidelberg 2002.

Cite

CITATION STYLE

APA

Boliac, R., & Lozin, V. (2002). On the clique-width of graphs in hereditary classes. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2518 LNCS, pp. 44–54). https://doi.org/10.1007/3-540-36136-7_5

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free