Mekkia Kouider

Publication Activity (10 Years)

Years Active: 1983-2022
Publications (10 Years): 5

Top Topics

Computational Effort

Top Venues

Discret. Appl. Math.

J. Comb. Optim.

Publications

Renata R. Del-Vecchio, Mekkia Kouider
New bounds for the b-chromatic number of vertex deleted graphs. Discret. Appl. Math. 306 (2022)
Mekkia Kouider, Mohamed Zamime
On the path partition of graphs. CoRR (2022)
Selma Djelloul, Odile Favaron, Mekkia Kouider
Edge k-q-Colorability of Graphs. J. Graph Algorithms Appl. 22 (2) (2018)
Mekkia Kouider, Mohamed Zamime
On the b-coloring of tight graphs. J. Comb. Optim. 33 (1) (2017)
Mekkia Kouider
On quasi-monotonous graphs. Discret. Appl. Math. 198 (2016)
Amine El Sahili, Mekkia Kouider, Maidoun Mortada
On the b-chromatic number of regular bounded graphs. Discret. Appl. Math. 193 (2015)
Mohamed Zamime, Mekkia Kouider, Hacène Aït Haddadène
On the b-coloring of G-e. Discret. Appl. Math. 188 (2015)
Amine El Sahili, Hamamache Kheddouci, Mekkia Kouider, Maidoun Mortada
The b-chromatic number and f-chromatic vertex number of regular graphs. Discret. Appl. Math. 179 (2014)
Odile Favaron, Mekkia Kouider
Even Factors of Large Size. J. Graph Theory 77 (1) (2014)
Mekkia Kouider
Stability Number and f-Factors in Graphs. Graphs Comb. 30 (1) (2014)
Mekkia Kouider, Saliha Ouatiki
Sufficient Condition for the Existence of an Even [a, b]-Factor in Graph. Graphs Comb. 29 (4) (2013)
Mekkia Kouider, Mario Valencia-Pabon
On lower bounds for the b-chromatic number of connected bipartite graphs. Electron. Notes Discret. Math. 37 (2011)
Odile Favaron, François Genest, Mekkia Kouider
Regular path decompositions of odd regular graphs. J. Graph Theory 63 (2) (2010)
Mekkia Kouider
Stability number and f-factors in graphs CoRR (2010)
Siham Bekkai, Mekkia Kouider
On mean distance and girth. Discret. Appl. Math. 158 (17) (2010)
Siham Bekkai, Mekkia Kouider
On pseudo 2-factors. Discret. Appl. Math. 157 (4) (2009)
Siham Bekkai, David Forge, Mekkia Kouider
Covering the vertices of a graph with cycles of bounded length. Discret. Math. 309 (8) (2009)
Amine El Sahili, Mekkia Kouider
About paths with two blocks. J. Graph Theory 55 (3) (2007)
David Forge, Mekkia Kouider
Coverings of the Vertices of a Graph by Small Cycles. Graphs Comb. 23 (2) (2007)
Mekkia Kouider, Preben D. Vestergaard
Generalized connected domination in graphs. Discret. Math. Theor. Comput. Sci. 8 (1) (2006)
Mekkia Kouider, Manouchehr Zaker
Bounds for the b-chromatic number of some families of graphs. Discret. Math. 306 (7) (2006)
Mekkia Kouider, Preben D. Vestergaard
Connected Factors in Graphs - a Survey. Graphs Comb. 21 (1) (2005)
Chính T. Hoàng, Mekkia Kouider
-dominating coloring of graphs. Discret. Appl. Math. 152 (1-3) (2005)
Mekkia Kouider, Zbigniew Lonc
]-factors in graphs. J. Graph Theory 46 (4) (2004)
Mekkia Kouider, Preben D. Vestergaard
Even [a, b]-factors in graphs. Discuss. Math. Graph Theory 24 (3) (2004)
Selma Djelloul, Mekkia Kouider
Minimum survivable graphs with bounded distance increase. Discret. Math. Theor. Comput. Sci. 6 (1) (2003)
Mekkia Kouider, Preben D. Vestergaard
On even [2, b]-factors in graphs. Australas. J Comb. 27 (2003)
Mekkia Kouider, Maryvonne Mahéo
-chromatic number of a grap. Discret. Math. 256 (1-2) (2002)
Mekkia Kouider, Maryvonne Mahéo
Connected [a, b]-factors in Graphs. Comb. 22 (1) (2002)
Mekkia Kouider, Antoni Marczyk
On pancyclism in hamiltonian graphs. Discret. Math. 251 (1-3) (2002)
Ahmed Ainouche, Mekkia Kouider
Cycles in Partially Square Graphs. Graphs Comb. 17 (1) (2001)
Selma Djelloul, Mekkia Kouider
On weighted mean distance. Australas. J Comb. 23 (2001)
Nathaniel Dean, Mekkia Kouider
Gallai's conjecture for disconnected graphs. Discret. Math. 213 (1-3) (2000)
Mekkia Kouider
Neighborhoods and Covering Vertices by Cycles. Comb. 20 (2) (2000)
Ahmed Ainouche, Mekkia Kouider
Hamiltonism and Partially Square Graphs. Graphs Comb. 15 (3) (1999)
Mekkia Kouider, Zbigniew Lonc
Path decompositions and perfect path double covers. Australas. J Comb. 19 (1999)
Mekkia Kouider, Peter Winkler
Erratum: Mean distance and minimum degree. J. Graph Theory 30 (3) (1999)
Krzysztof Brys, Mekkia Kouider, Zbigniew Lonc, Maryvonne Mahéo
Decomposition of multigraphs. Discuss. Math. Graph Theory 18 (2) (1998)
Mekkia Kouider, Peter Winkler
Mean distance and minimum degree. J. Graph Theory 25 (1) (1997)
Mekkia Kouider, Zbigniew Lonc
-Term Degree Sums. Comb. 16 (3) (1996)
Mekkia Kouider, Gert Sabidussi
Factorizations of 4-Regular Graphs and Petersen's Theorem. J. Comb. Theory, Ser. B 63 (2) (1995)
Hikoe Enomoto, Atsushi Kaneko, Mekkia Kouider, Zsolt Tuza
Degree Sums and Covering Cycles. J. Graph Theory 20 (4) (1995)
Mekkia Kouider
Covering vertices by cycles. J. Graph Theory 18 (8) (1994)
Mekkia Kouider
Cycles in Graphs with Prescribed Stability Number and Connectivity. J. Comb. Theory, Ser. B 60 (2) (1994)
Mekkia Kouider, Dominique Sotteau
On the existence of a matching orthogonal to a 2-factorization. Discret. Math. 73 (3) (1989)
Odile Favaron, Mekkia Kouider, Maryvonne Mahéo
Edge-vulnerability and mean distance. Networks 19 (5) (1989)
J. Adrian Bondy, Mekkia Kouider
Hamilton cycles in regular 2-connected graphs. J. Comb. Theory, Ser. B 44 (2) (1988)
François Jaeger, Charles Payan, Mekkia Kouider
Partition of odd regular graphs into bistars. Discret. Math. 46 (1) (1983)