Maidoun Mortada

activity

20132026

most citedOn The b-Chromatic Number of Regular Bounded Graphs

2 citations · 3 across the 8 of their papers we have counts for

collaborators

Showing 2025Show all

2 papers · 1 filter

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…