HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation
Journal articles

Critical vertices and edges in H-free graphs

Résumé : 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.
Complete list of metadata

Cited literature [24 references]  Display  Hide  Download

Contributor : Christophe Picouleau Connect in order to contact the contributor
Submitted on : Tuesday, February 25, 2020 - 4:24:44 PM
Last modification on : Monday, February 21, 2022 - 3:38:20 PM
Long-term archiving on: : Tuesday, May 26, 2020 - 6:39:35 PM


Files produced by the author(s)


Distributed under a Creative Commons Attribution - NonCommercial - NoDerivatives 4.0 International License



Daniël Paulusma, Christophe Picouleau, Bernard Ries. Critical vertices and edges in H-free graphs. Discrete Applied Mathematics, Elsevier, 2019, 257, pp.361-367. ⟨10.1016/j.dam.2018.08.016⟩. ⟨hal-02436807⟩



Record views


Files downloads