Partition of odd regular graphs into bistars. - François Jaeger; Charles Payan; Mekkia Kouider (Discret. Math., 1983)

Hamilton cycles in regular 2-connected graphs. - J. Adrian Bondy; Mekkia Kouider (J. Comb. Theory B, 1988)

On the existence of a matching orthogonal to a 2-factorization. - Mekkia Kouider; Dominique Sotteau (Discret. Math., 1989)

Edge-vulnerability and mean distance. - Odile Favaron; Mekkia Kouider; Maryvonne Mahéo (Networks, 1989)

Cycles in Graphs with Prescribed Stability Number and Connectivity. - Mekkia Kouider (J. Comb. Theory B, 1994)

Covering vertices by cycles. - Mekkia Kouider (J. Graph Theory, 1994)

Factorizations of 4-Regular Graphs and Petersen's Theorem. - Mekkia Kouider; Gert Sabidussi (J. Comb. Theory B, 1995)

Degree Sums and Covering Cycles. - Hikoe Enomoto; Atsushi Kaneko; Mekkia Kouider; Zsolt Tuza (J. Graph Theory, 1995)

Covering Cycles and k-Term Degree Sums. - Mekkia Kouider; Zbigniew Lonc (Comb., 1996)

Mean distance and minimum degree. - Mekkia Kouider; Peter Winkler 001 (J. Graph Theory, 1997)

Decomposition of multigraphs. - Krzysztof Brys; Mekkia Kouider; Zbigniew Lonc; Maryvonne Mahéo (Discuss. Math. Graph Theory, 1998)

Path decompositions and perfect path double covers. - Mekkia Kouider; Zbigniew Lonc (Australas. J Comb., 1999)

Hamiltonism and Partially Square Graphs. - Ahmed Ainouche; Mekkia Kouider (Graphs Comb., 1999)

Erratum: Mean distance and minimum degree. - Mekkia Kouider; Peter Winkler 001 (J. Graph Theory, 1999)

Neighborhoods and Covering Vertices by Cycles. - Mekkia Kouider (Comb., 2000)

Gallai's conjecture for disconnected graphs. - Nathaniel Dean; Mekkia Kouider (Discret. Math., 2000)

On weighted mean distance. - Selma Djelloul; Mekkia Kouider (Australas. J Comb., 2001)

Cycles in Partially Square Graphs. - Ahmed Ainouche; Mekkia Kouider (Graphs Comb., 2001)

Connected [a, b]-factors in Graphs. - Mekkia Kouider; Maryvonne Mahéo (Comb., 2002)

Some bounds for the b-chromatic number of a grap. - Mekkia Kouider; Maryvonne Mahéo (Discret. Math., 2002)

On pancyclism in hamiltonian graphs. - Mekkia Kouider; Antoni Marczyk (Discret. Math., 2002)

On even [2, b]-factors in graphs. - Mekkia Kouider; Preben D. Vestergaard (Australas. J Comb., 2003)

Minimum survivable graphs with bounded distance increase. - Selma Djelloul; Mekkia Kouider (Discret. Math. Theor. Comput. Sci., 2003)

Even [a, b]-factors in graphs. - Mekkia Kouider; Preben D. Vestergaard (Discuss. Math. Graph Theory, 2004)

Stability number and [a, b]-factors in graphs. - Mekkia Kouider; Zbigniew Lonc (J. Graph Theory, 2004)

On the b-dominating coloring of graphs. - Chính T. Hoàng; Mekkia Kouider (Discret. Appl. Math., 2005)

Connected Factors in Graphs - a Survey. - Mekkia Kouider; Preben D. Vestergaard (Graphs Comb., 2005)

Bounds for the b-chromatic number of some families of graphs. - Mekkia Kouider; Manouchehr Zaker (Discret. Math., 2006)

Generalized connected domination in graphs. - Mekkia Kouider; Preben D. Vestergaard (Discret. Math. Theor. Comput. Sci., 2006)

Coverings of the Vertices of a Graph by Small Cycles. - David Forge; Mekkia Kouider (Graphs Comb., 2007)

About paths with two blocks. - Amine El Sahili; Mekkia Kouider (J. Graph Theory, 2007)

On pseudo 2-factors. - Siham Bekkai; Mekkia Kouider (Discret. Appl. Math., 2009)

Covering the vertices of a graph with cycles of bounded length. - Siham Bekkai; David Forge; Mekkia Kouider (Discret. Math., 2009)

On mean distance and girth. - Siham Bekkai; Mekkia Kouider (Discret. Appl. Math., 2010)

Regular path decompositions of odd regular graphs. - Odile Favaron; François Genest; Mekkia Kouider (J. Graph Theory, 2010)

On lower bounds for the b-chromatic number of connected bipartite graphs. - Mekkia Kouider; Mario Valencia-Pabon (Electron. Notes Discret. Math., 2011)

Sufficient Condition for the Existence of an Even [a, b]-Factor in Graph. - Mekkia Kouider; Saliha Ouatiki (Graphs Comb., 2013)

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)

Stability Number and f-Factors in Graphs. - Mekkia Kouider (Graphs Comb., 2014)

Even Factors of Large Size. - Odile Favaron; Mekkia Kouider (J. Graph Theory, 2014)

On the b-chromatic number of regular bounded graphs. - Amine El Sahili; Mekkia Kouider; Maidoun Mortada (Discret. Appl. Math., 2015)

On the b-coloring of G-e. - Mohamed Zamime; Mekkia Kouider; Hacène Aït Haddadène (Discret. Appl. Math., 2015)

On quasi-monotonous graphs. - Mekkia Kouider (Discret. Appl. Math., 2016)

On the b-coloring of tight graphs. - Mekkia Kouider; Mohamed Zamime (J. Comb. Optim., 2017)

Edge k-q-Colorability of Graphs. - Selma Djelloul; Odile Favaron; Mekkia Kouider (J. Graph Algorithms Appl., 2018)

On the path partition of graphs. - Mekkia Kouider; Mohamed Zamime (CoRR, 2022)

New bounds for the b-chromatic number of vertex deleted graphs. - Renata R. Del-Vecchio; Mekkia Kouider (Discret. Appl. Math., 2022)