Critical vertices and edges in H-free graphs - Archive ouverte HAL Access content directly
Journal Articles Discrete Applied Mathematics Year : 2019

Critical vertices and edges in H-free graphs

Abstract

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.
Fichier principal
Vignette du fichier
26280.pdf (394.76 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-02436807 , version 1 (25-02-2020)

Licence

Attribution - NonCommercial - NoDerivatives

Identifiers

Cite

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

Altmetric

Share

Gmail Facebook Twitter LinkedIn More