On quasi-planar graphs : clique-width and logical description - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Discrete Applied Mathematics Année : 2018

On quasi-planar graphs : clique-width and logical description

Résumé

Motivated by the construction of FPT graph algorithms parameterized by clique-width or tree-width, we study graph classes for which tree-width and clique-width are linearly related. This is the case for all graph classes of bounded expansion, but in view of concrete applications, we want to have "small" constants in the comparisons between these width parameters. We focus our attention on graphs that can be drawn in the plane with limited edge crossings, for an example, at most p crossings for each edge. These graphs are called p-planar. We consider a more general situation where the graph of edge crossings must belong to a fixed class of graphs D. For p-planar graphs, D is the class of graphs of degree at most p. We prove that tree-width and clique-width are linearly related for graphs drawable with a graph of crossings of bounded average degree. We prove that the class of 1-planar graphs, although conceptually close to that of planar graphs, is not characterized by a monadic second-order sentence. We identify two subclasses that are.
Fichier principal
Vignette du fichier
quasiplanar2.pdf (437.9 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01735820 , version 1 (16-03-2018)
hal-01735820 , version 2 (03-03-2020)

Identifiants

Citer

Bruno Courcelle. On quasi-planar graphs : clique-width and logical description. Discrete Applied Mathematics, 2018, ⟨10.1016/j.dam.2018.07.022⟩. ⟨hal-01735820v2⟩

Collections

CNRS ANR
110 Consultations
303 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More