On the chromatic vertex stability number of graphs

DOI10.1016/j.ejc.2021.103504zbMath1486.05079arXiv2108.12994OpenAlexW4205676914MaRDI QIDQ2122687

Nazanin Movarraei, Sandi Klavžar, Arash Beikmohammadi, Saieed Akbari

Publication date: 7 April 2022

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2108.12994

zbMATH Keywords

Nordhaus-Gaddum-type resultindependent chromatic vertex stability number

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Coloring of graphs and hypergraphs (05C15)

Related Items (3)

When removing an independent set is optimal for reducing the chromatic number ⋮ On the vertex stability numbers of graphs ⋮ Tight bounds on the chromatic edge stability index of graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Domination alteration sets in graphs
• On the chromatic edge stability number of graphs
• Nordhaus-Gaddum and other bounds for the chromatic edge-stability number
• On the \(\rho \)-edge stability number of graphs
• Critical graphs for the chromatic edge-stability number
• On Complementary Graphs
• Stabilizing the distinguishing number of a graph
• On the dominated chromatic number of certain graphs

This page was built for publication: On the chromatic vertex stability number of graphs