Showing math.COShow all
3 papers · 1 filter
math.CO2024
On the -edge stability number of graphs
Saieed Akbari, Reza Hosseini Dolatabadi, Mohsen Jamaali +2
The -edge stability number of a graph is the minimum number of edges of whose removal results in a subgraph with . Sets whose removal…
math.CO2021
On the Chromatic Vertex Stability Number of Graphs
Saieed Akbari, Arash Beikmohammadi, Sandi Klavžar +1
The chromatic vertex (resp.\ edge) stability number (resp.\ ) of a graph is the minimum number of vertices (resp.\ edges) whose deletion results…
math.CO2019
Critical graphs for the chromatic edge-stability number
Boštjan Brešar, Sandi Klavžar, Nazanin Movarraei
The chromatic edge-stability number of a graph is the minimum number of edges whose removal results in a spanning subgraph with . Edge-stabil…