3 papers
math.CO2026
Pollyanna and Polynomially \c{hi}-Bounded Graph Classes
Narjes Rahimi, D. A. Mojdeh
A hereditary graph class is called polynomially -bounded if there exists a polynomial function such that for every induced subgraph . A class $\math…
math.CO2025
Towards Esperet's Conjecture: Polynomial -Bounds for Structured Graph Classes
N. Rahimi, D. A. Mojdeh
In this paper, we establish that the class of -free graphs contains a subclass , defined by certain cutset conditions, whose chromatic n…
math.CO2025
On the analogue of Esperet's conjecture: Characterizing hereditary classes
N. Rahimi, D. A. Mojdeh
In the paper [J. Graph Theory (2023) 102:458-471, the Esperet's conjecture has been posed: Every -bounded hereditary class is poly--bounded]. This conjecture was first pose…