On the vertex stability numbers of graphs

DOI10.1016/j.dam.2023.11.008zbMath1529.05132OpenAlexW4388519607MaRDI QIDQ6180560

Arnfried Kemnitz, Massimiliano Marangio

Publication date: 22 December 2023

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2023.11.008

zbMATH Keywords

chromatic numbergraph invariantedge stability numbervertex stability number

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cites Work

• Unnamed Item
• Unnamed Item
• 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
• On the chromatic vertex stability number of graphs
• Critical graphs for the chromatic edge-stability number
• On the Total Chromatic Edge Stability Number and the Total Chromatic Subdivision Number of Graphs
• When removing an independent set is optimal for reducing the chromatic number
• A Gallai’s Theorem type result for the edge stability of graphs

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