 | 2011 |
|---|
| 14 |       | Mostafa Blidia,
Widad Dali:
A characterization of locating-total domination edge critical graphs.
Discussiones Mathematicae Graph Theory 31(1): 197-202 (2011) |
| 2009 |
|---|
| 13 | | Mostafa Blidia,
Frédéric Maffray,
Zoham Zemir:
On b-colorings in regular graphs.
Discrete Applied Mathematics 157(8): 1787-1793 (2009) |
| 2008 |
|---|
| 12 | | Mostafa Blidia,
Mustapha Chellali,
Frédéric Maffray:
Extremal perfect graphs for a bound on the domination number.
Discrete Mathematics 308(10): 1785-1791 (2008) |
| 11 | | Mostafa Blidia,
Mustapha Chellali,
Odile Favaron,
Nacéra Meddah:
Maximal k-independent sets in graphs.
Discussiones Mathematicae Graph Theory 28(1): 151-163 (2008) |
| 2007 |
|---|
| 10 | | Mostafa Blidia,
Mustapha Chellali,
Odile Favaron,
Nacéra Meddah:
On k-independence in graphs with emphasis on trees.
Discrete Mathematics 307(17-18): 2209-2216 (2007) |
| 2006 |
|---|
| 9 | | Mostafa Blidia,
Mustapha Chellali,
Teresa W. Haynes:
Characterizations of trees with equal paired and double domination numbers.
Discrete Mathematics 306(16): 1840-1845 (2006) |
| 8 | | Mostafa Blidia,
Mustapha Chellali,
Lutz Volkmann:
Some bounds on the p-domination number in trees.
Discrete Mathematics 306(17): 2031-2037 (2006) |
| 7 | | Mostafa Blidia,
Mustapha Chellali,
Frédéric Maffray:
Extremal graphs for a new upper bound on domination parameters in graphs.
Discrete Mathematics 306(19-20): 2314-2326 (2006) |
| 2005 |
|---|
| 6 | | Mostafa Blidia,
Mustapha Chellali,
Frédéric Maffray:
On average lower independence and domination numbers in graphs.
Discrete Mathematics 295(1-3): 1-11 (2005) |
| 5 | | Mostafa Blidia,
Mustapha Chellali,
Lutz Volkmann:
On the p-domination number of cactus graphs.
Discussiones Mathematicae Graph Theory 25(3): 355-361 (2005) |
| 1999 |
|---|
| 4 | | Mostafa Blidia,
Pierre Duchet,
Henry Jacob,
Frédéric Maffray,
Henry Meyniel:
Some operations preserving the existence of kernels.
Discrete Mathematics 205(1-3): 211-216 (1999) |
| 1993 |
|---|
| 3 | | Mostafa Blidia,
Pierre Duchet,
Frédéric Maffray:
On kernels in perfect graphs.
Combinatorica 13(2): 231-233 (1993) |
| 1992 |
|---|
| 2 | | Mostafa Blidia,
Konrad Engel:
Perfectly orderable graphs and almost all perfect graphs are kernelM-solvable.
Graphs and Combinatorics 8(2): 103-108 (1992) |
| 1986 |
|---|
| 1 | | Mostafa Blidia:
A parity diagraph has a kernel.
Combinatorica 6(1): 23-27 (1986) |
Data released under the ODC-BY 1.0 license — See also our legal information page