3 papers
math.CO2026
Bounds for the Vertex Chromatic Number of Connected Triangle-Free Graphs
Saieed Akbari, Arash Beikmohammadi
It was recently shown that every connected graph of order and size satisfies , and it was asked whether the st…
math.CO2025
Tight Bounds for Cycle-Edge Decompositions and Covers
Saieed Akbari, Jonny Aloni, Arash Beikmohammadi +1
An old conjecture of Erd{ő}s and Gallai states that every vertex graph can be decomposed, that is can be partitioned, into cycles and edges. The covering version…
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…