On chromatic vertex stability of 3-chromatic graphs with maximum degree 4

Abstract

The (independent) chromatic vertex stability (ivsIn this paper we construct infinitely many graphs G with ∆(G) = 4, χ(G) = 3, ivs χ (G) = 3 and vs χ (G) = 2, which gives a partial negative answer to a problem posed in [3].