Maidoun Mortada

According to our database, Maidoun Mortada authored at least 9 papers between 2014 and 2026.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of three.

2026

A short proof that every claw-free cubic graph is ( 1 , 1 , 2 , 2 ) -packing colorable.

Maidoun Mortada, Ayman El Zein

Discret. Appl. Math., 2026

On the ( 1 , 1 , 2 , 3 ) -packing coloring of some subcubic graphs.

Maidoun Mortada, Ayman El Zein

Discret. Appl. Math., 2026

2025

Further results and questions on S-packing coloring of subcubic graphs.

Maidoun Mortada, Olivier Togni

Discret. Math., 2025

2024

The Existence of a Path with Two Blocks in Digraphs.

Amine El Sahili, Maidoun Mortada, Sara Nasser

Graphs Comb., April, 2024

About S-packing coloring of subcubic graphs.

Maidoun Mortada, Olivier Togni

Discret. Math., 2024

About S-packing coloring of 3-irregular subcubic graphs.

Maidoun Mortada

Discret. Appl. Math., 2024

2021

About paths with three blocks.

Maidoun Mortada, Amine El Sahili, Mouhamad El Joubbeh

Australas. J Comb., 2021

2015

On the b-chromatic number of regular bounded graphs.

Amine El Sahili, Mekkia Kouider, Maidoun Mortada

Discret. Appl. Math., 2015

2014

The b-chromatic number and f-chromatic vertex number of regular graphs.

Amine El Sahili, Hamamache Kheddouci, Mekkia Kouider, Maidoun Mortada

Discret. Appl. Math., 2014