Between clique-width and linear clique-width of bipartite graphs - Université Clermont Auvergne Accéder directement au contenu
Article Dans Une Revue Discrete Mathematics Année : 2020

Between clique-width and linear clique-width of bipartite graphs

Résumé

We consider hereditary classes of bipartite graphs where clique-width is bounded, but linear clique-width is not. Our goal is identifying classes that are critical with respect to linear clique-width. We discover four such classes and conjecture that this list is complete, i.e. a hereditary class of bipartite graphs of bounded clique-width that excludes a graph from each of the four critical classes has bounded linear clique-width.

Dates et versions

hal-04056409 , version 1 (03-04-2023)

Identifiants

Citer

Bogdan Alecu, Mamadou Moustapha Kanté, Vadim Lozin, Viktor Zamaraev. Between clique-width and linear clique-width of bipartite graphs. Discrete Mathematics, 2020, 343 (8), pp.111926. ⟨10.1016/j.disc.2020.111926⟩. ⟨hal-04056409⟩
14 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More