Mostafa Blidia Coauthor index pubzone.org

List of publications from the DBLP Bibliography Server - FAQ
Other views: by type - by year (modern) - classic-C
Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo
DBLP keys2013
j17Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Mostafa Blidia, Nacéra Meddah: A characterization of trees for new lower bound on the k-independence number. Discussiones Mathematicae Graph Theory 33(2): 395-410 (2013)
2011
j16Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Mostafa Blidia, Widad Dali: A characterization of locating-total domination edge critical graphs. Discussiones Mathematicae Graph Theory 31(1): 197-202 (2011)
j15Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Mostafa Blidia, Ahmed Bouchou: On sequences (γk) and (βk) in regular graphs. Stud. Inform. Univ. 9(2): 7-18 (2011)
2009
j14Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Mostafa Blidia, Frédéric Maffray, Zoham Zemir: On b-colorings in regular graphs. Discrete Applied Mathematics 157(8): 1787-1793 (2009)
2008
j13Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
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)
j12Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
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
j11Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
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
j10Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Mostafa Blidia, Mustapha Chellali, Teresa W. Haynes: Characterizations of trees with equal paired and double domination numbers. Discrete Mathematics 306(16): 1840-1845 (2006)
j9Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Mostafa Blidia, Mustapha Chellali, Lutz Volkmann: Some bounds on the p-domination number in trees. Discrete Mathematics 306(17): 2031-2037 (2006)
j8Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
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
j7Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
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)
j6Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Mostafa Blidia, Mustapha Chellali, Lutz Volkmann: On the p-domination number of cactus graphs. Discussiones Mathematicae Graph Theory 25(3): 355-361 (2005)
1999
j5Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
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)
1994
j4Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Mostafa Blidia, Pierre Duchet, Frédéric Maffray: On the orientation of meyniel graphs. Journal of Graph Theory 18(7): 705-711 (1994)
1993
j3Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Mostafa Blidia, Pierre Duchet, Frédéric Maffray: On kernels in perfect graphs. Combinatorica 13(2): 231-233 (1993)
1992
j2Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Mostafa Blidia, Konrad Engel: Perfectly orderable graphs and almost all perfect graphs are kernelM-solvable. Graphs and Combinatorics 8(2): 103-108 (1992)
1986
j1Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Mostafa Blidia: A parity diagraph has a kernel. Combinatorica 6(1): 23-27 (1986)

Coauthor Index

1Ahmed Bouchou
[j15]
2Mustapha Chellali
[j13] [j12] [j11] [j10] [j9] [j8] [j7] [j6]
3Widad Dali
[j16]
4Pierre Duchet
[j5] [j4] [j3]
5Konrad Engel
[j2]
6Odile Favaron
[j12] [j11]
7Teresa W. Haynes
[j10]
8Henry Jacob
[j5]
9Frédéric Maffray
[j14] [j13] [j8] [j7] [j5] [j4] [j3]
10Nacéra Meddah
[j17] [j12] [j11]
11Henry Meyniel
[j5]
12Lutz Volkmann
[j9] [j6]
13Zoham Zemir
[j14]
Last update Sat May 18 14:44:23 2013 CET by the DBLP TeamThis material is Open Data Data released under the ODC-BY 1.0 license — See also our legal information page