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

8 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…

math.CO2024★ 1 cited

Further Results and Questions on $S$ -Packing Coloring of Subcubic Graphs

Maidoun Mortada, Olivier Togni

For non-decreasing sequence of integers $S = (a_{1}, a_{2}, \dots, a_{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 distan…

math.CO2021

Paths With Three Blocks In Digraphs

Maidoun Mortada, Amine El Sahili, Zahraa Mohsen

A path with three blocks $P (k, l, r)$ is an oriented path formed by $k$ -forward arcs followed by $l$ -backward arcs then $r$ -forward arcs. We prove that any $(2 k + 1)$ -chromatic digraph…

math.CO2013

Labeled Packing of Non Star Tree into its Fifth Power and Sixth Power

Amine El Sahili, Hamamache Kheddouci, Maidoun Mortada

In this paper we prove that we can find a labeled packing of a non star tree $T$ into $T^{6}$ with $m_{T} + ⌈ \frac{n - m _{T}}{5} ⌉$ labels, where $n$ is the number of vertices of $T…

math.CO2013★ 2 cited

On The b-Chromatic Number of Regular Bounded Graphs

Amine El Sahili, Mekkia Kouider, Maidoun Mortada

A $b$ -coloring of a graph is a proper coloring such that every color class contains a vertex adjacent to at least one vertex in each of the other color classes. The $b$ -chromatic n…