A characterisation of clique-width through nested partitions - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Discrete Applied Mathematics Année : 2015

A characterisation of clique-width through nested partitions

Résumé

Clique-width of graphs is defined algebraically through operations on graphs with vertex labels. We characterise the clique-width in a combinatorial way by means of partitions of the vertex set, using trees of nested partitions where partitions are ordered bottom-up by refinement. We show that the correspondences in both directions, between combinatorial partition trees and algebraic terms, preserve the tree structures and that they are computable in polynomial time. We apply our characterisation to linear clique-width. And we relate our characterisation to a clique-width characterisation by Heule and Szeider that is used to reduce the clique-width decision problem to a satisfiability problem.
Fichier principal
Vignette du fichier
cwdcharacterisation.pdf (243.55 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01022109 , version 1 (10-07-2014)

Identifiants

  • HAL Id : hal-01022109 , version 1

Citer

Bruno Courcelle, Pinar Heggernes, Daniel Meister, Charis Papadopoulos, Udi Rotics. A characterisation of clique-width through nested partitions. Discrete Applied Mathematics, 2015, 187, pp.70-81. ⟨hal-01022109⟩

Collections

CNRS
200 Consultations
200 Téléchargements

Partager

Gmail Facebook X LinkedIn More