Maidoun Mortada

collaborators

4 papers

math.CO2026

On (1,1,2,3)- and (1,1,3,3,3)-Packing Colorings of Claw-Free Subcubic Graphs

Maidoun Mortada, Ayman El Zein, Sara Al Hajjar

For a non-decreasing sequence $S = (a_{1}, a_{2}, \dots, a_{r})$ of positive integers, an $S$ -packing coloring of a graph $G$ is a partition of $V (G)$ into sets $A_{1}, \dots, A_{r}$ such that an…

math.CO2026

Impact of local girth on the S-packing coloring of k-saturated subcubic graphs

Ayman El Zein, Maidoun Mortada

For a non-decreasing sequence $S = (s_{1}, s_{2}, \dots, s_{k})$ , an $S$ -packing coloring of a graph $G$ is a vertex coloring using the colors $s_{1}, s_{2}, \dots, s_{k}$ such that any two vertices a…

math.CO2025

A Short Proof that Every Claw-Free Cubic Graph is (1,1,2,2)-Packing Colorable

Maidoun Mortada, Ayman El Zein

It was recently proved that every claw-free cubic graph admits a (1, 1, 2, 2)-packing coloring--that is, its vertex set can be partitioned into two 1-packings and two 2-packings. T…

math.CO2025

Advances on the Packing Coloring Conjectures of Subcubic Graphs

Ayman El Zein, Maidoun Mortada

For a non-decreasing sequence of integers $S = (s_{1}, s_{2}, \dots, s_{k})$ , an $S$ -packing coloring of $G$ is a partition of $V (G)$ into $k$ subsets $V_{1}, V_{2}, \dots, V_{k}$ such that the dist…