19 papers · 1 filter
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 $\mathcal…
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…
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 posed…
Total perfect codes in Cayley sum graphs of cyclic groups
Masoumeh Koohestani, Doost Ali Mojdeh, Mohsen Ghasemi
We consider Cayley sum graphs over the cyclic group and aim to explore several necessary and sufficient conditions for the existence of total perfect codes in these…
Some results on perfect codes in Cayley sum graphs
Masoumeh Koohestani, Doost Ali Mojdeh, Mohsen Ghasemi +1
We establish a necessary and sufficient condition for a normal subgroup of a finite group to be a subgroup perfect code.
Perfect coalition in graphs
Doost Ali Mojdeh, Mohammad Reza Samadzadeh
\noindent A perfect dominating set in a graph is a subset such that each vertex in has exactly one neighbor in . A perfect coalition in…