3 citations · 5 across the 4 of their papers we have counts for
5 papers
On the path partition of graphs
M. Kouider, M. Zamime
Let be a graph of order . The maximum and minimum degree of are denoted by and respectively. The \emph{path partition number} of a graph is the minimu…
New bounds for the b-chromatic number of vertex deleted graphs
Renata Del-Vecchio, Mekkia Kouider
A b-coloring of a graph is a proper coloring of its vertices such that each color class contains a vertex adjacent to at least one vertex of every other color class. The b-chromati…
On The b-Chromatic Number of Regular Bounded Graphs
Amine El Sahili, Mekkia Kouider, Maidoun Mortada
A -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 -chromatic n…
On Mean Distance and Girth
Siham Bekkai, Mekkia Kouider
We bound the mean distance in a connected graph which is not a tree in function of its order and its girth . On one hand, we show that mean distance is at most $\frac{n+1}{3…
Bounds for the -chromatic number of some families of graphs
Mekkia Kouider, Manouchehr Zaker
In this paper we obtain some upper bounds for -chromatic number of -free graphs, graphs with given minimum clique partition and bipartite graphs. These bounds are in t…