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 metadatas

Cited literature [24 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-02436807
Contributor : Christophe Picouleau <>
Submitted on : Tuesday, February 25, 2020 - 4:24:44 PM
Last modification on : Thursday, February 27, 2020 - 3:32:03 PM

File

26280.pdf
Files produced by the author(s)

Identifiers

Citation

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⟩

Share

Metrics

Record views

11