Thumbnail

Critical vertices and edges in H-free graphs

Paulusma, Daniël; Picouleau, Christophe; Ries, Bernard (2019), Critical vertices and edges in H-free graphs, Discrete Applied Mathematics, 257, p. 361-367. 10.1016/j.dam.2018.08.016

Voir/Ouvrir
Type
Article accepté pour publication ou publié
Date
2019
Nom de la revue
Discrete Applied Mathematics
Volume
257
Éditeur
Elsevier
Pages
361-367
Identifiant publication
Métadonnées
Afficher la notice complète
Auteur(s)
Paulusma, Daniël

Picouleau, Christophe cc

Ries, Bernard
Laboratoire d'analyse et modélisation de systèmes pour l'aide à la décision [LAMSADE]
Résumé (EN)
A vertex or edge in a graph is critical if its deletion reduces the chromatic number of the graph by one. We consider the problems of deciding whether a graph has a critical vertex or edge, respectively. We give a complexity dichotomy for both problems restricted to H-free graphs, that is, graphs with no induced subgraph isomorphic to H. Moreover, we show that an edge is critical if and only if its contraction reduces the chromatic number by one. Hence, we also obtain a complexity dichotomy for the problem of deciding if a graph has an edge whose contraction reduces the chromatic number by one.
Mots-clés
vertex deletion; edge contraction; chromatic number