A parity diagraph has a kernel. - Mostafa Blidia (Comb., 1986)

Perfectly orderable graphs and almost all perfect graphs are kernelM-solvable. - Mostafa Blidia; Konrad Engel (Graphs Comb., 1992)

On kernels in perfect graphs. - Mostafa Blidia; Pierre Duchet; Frédéric Maffray (Comb., 1993)

On the orientation of meyniel graphs. - Mostafa Blidia; Pierre Duchet; Frédéric Maffray (J. Graph Theory, 1994)

Some operations preserving the existence of kernels. - Mostafa Blidia; Pierre Duchet; Henry Jacob; Frédéric Maffray; Henry Meyniel (Discret. Math., 1999)

Independence and 2-domination in trees. - Mostafa Blidia; Mustapha Chellali; Odile Favaron (Australas. J Comb., 2005)

On average lower independence and domination numbers in graphs. - Mostafa Blidia; Mustapha Chellali; Frédéric Maffray (Discret. Math., 2005)

On the p-domination number of cactus graphs. - Mostafa Blidia; Mustapha Chellali; Lutz Volkmann (Discuss. Math. Graph Theory, 2005)

Characterizations of trees with equal paired and double domination numbers. - Mostafa Blidia; Mustapha Chellali; Teresa W. Haynes (Discret. Math., 2006)

Extremal graphs for a new upper bound on domination parameters in graphs. - Mostafa Blidia; Mustapha Chellali; Frédéric Maffray (Discret. Math., 2006)

Some bounds on the p-domination number in trees. - Mostafa Blidia; Mustapha Chellali; Lutz Volkmann (Discret. Math., 2006)

Locating-domination and identifying codes in trees. - Mostafa Blidia; Mustapha Chellali; Frédéric Maffray; Julien Moncel; Ahmed Semri (Australas. J Comb., 2007)

On k-independence in graphs with emphasis on trees. - Mostafa Blidia; Mustapha Chellali; Odile Favaron; Nacéra Meddah (Discret. Math., 2007)

Locating-domination, 2-domination and independence in trees. - Mostafa Blidia; Odile Favaron; Rahma Lounes (Australas. J Comb., 2008)

Extremal perfect graphs for a bound on the domination number. - Mostafa Blidia; Mustapha Chellali; Frédéric Maffray (Discret. Math., 2008)

Maximal k-independent sets in graphs. - Mostafa Blidia; Mustapha Chellali; Odile Favaron; Nacéra Meddah (Discuss. Math. Graph Theory, 2008)

A characterization of locating-domination edge critical graphs. - Mostafa Blidia; Widad Dali (Australas. J Comb., 2009)

On b-colorings in regular graphs. - Mostafa Blidia; Frédéric Maffray; Zoham Zemir (Discret. Appl. Math., 2009)

Bounds on the domination number in oriented graphs. - Mostafa Blidia; Lyes Ould-Rabah (Australas. J Comb., 2010)

Double domination edge removal critical graphs. - Soufiane Khelifi; Mostafa Blidia; Mustapha Chellali; Frédéric Maffray (Australas. J Comb., 2010)

A characterization of locating-total domination edge critical graphs. - Mostafa Blidia; Widad Dali (Discuss. Math. Graph Theory, 2011)

On sequences (γk) and (βk) in regular graphs. - Mostafa Blidia; Ahmed Bouchou (Stud. Inform. Univ., 2011)

b-coloring of some bipartite graphs. - Mostafa Blidia; Noureddine Ikhlef Eschouf; Frédéric Maffray (Australas. J Comb., 2012)

Criticality indices of Roman domination of paths and cycles. - Ahmed Bouchou; Mostafa Blidia (Australas. J Comb., 2013)

ERRATUM to: Double domination edge removal critical graphs. - Soufiane Khelifi; Mostafa Blidia; Mustapha Chellali; Frédéric Maffray (Australas. J Comb., 2013)

A characterization of trees for new lower bound on the k-independence number. - Mostafa Blidia; Nacéra Meddah (Discuss. Math. Graph Theory, 2013)

On the k-independence number in graphs. - Ahmed Bouchou; Mostafa Blidia (Australas. J Comb., 2014)

Bounds on the k-independence and k-chromatic numbers of graphs. - Mostafa Blidia; Ahmed Bouchou; Lutz Volkmann (Ars Comb., 2014)

Relations between the Roman k-domination and Roman domination numbers in graphs. - Ahmed Bouchou; Mostafa Blidia; Mustapha Chellali (Discret. Math. Algorithms Appl., 2014)

On edge-b-critical graphs. - Noureddine Ikhlef Eschouf; Mostafa Blidia; Frédéric Maffray (Discret. Appl. Math., 2015)

A new generalization of kernels in digraphs. - Amina Ramoul; Mostafa Blidia (Discret. Appl. Math., 2017)

A characterization of edge b-critical graphs. - Amel Bendali-Braham; Noureddine Ikhlef Eschouf; Mostafa Blidia (Discret. Appl. Math., 2018)

Extremal digraphs for an upper bound on the Roman domination number. - Lyes Ouldrabah; Mostafa Blidia; Ahmed Bouchou (J. Comb. Optim., 2019)

On the k-domination number of digraphs. - Lyes Ouldrabah; Mostafa Blidia; Ahmed Bouchou (J. Comb. Optim., 2019)

Some results on the b-chromatic number in complementary prism graphs. - Amel Bendali-Braham; Noureddine Ikhlef Eschouf; Mostafa Blidia (RAIRO Oper. Res., 2019)

Extremal graphs for a bound on the Roman domination number. - Mostafa Blidia; Ahmed Bouchou; Mustapha Chellali (Discuss. Math. Graph Theory, 2020)

Roman domination in oriented trees. - Lyes Ouldrabah; Mostafa Blidia; Ahmed Bouchou (Electron. J. Graph Theory Appl., 2021)