 | 2011 |
| 28 |  | Mekkia Kouider,
Mario Valencia-Pabon:
On lower bounds for the b-chromatic number of connected bipartite graphs.
Electronic Notes in Discrete Mathematics 37: 399-404 (2011) |
| 2010 |
| 27 |  | Mekkia Kouider:
Stability number and f-factors in graphs
CoRR abs/1011.0636: (2010) |
| 26 |  | Siham Bekkai,
Mekkia Kouider:
On mean distance and girth.
Discrete Applied Mathematics 158(17): 1888-1893 (2010) |
| 25 |  | Odile Favaron,
François Genest,
Mekkia Kouider:
Regular path decompositions of odd regular graphs.
Journal of Graph Theory 63(2): 114-128 (2010) |
| 2009 |
| 24 |  | Siham Bekkai,
Mekkia Kouider:
On pseudo 2-factors.
Discrete Applied Mathematics 157(4): 774-779 (2009) |
| 23 |  | Siham Bekkai,
David Forge,
Mekkia Kouider:
Covering the vertices of a graph with cycles of bounded length.
Discrete Mathematics 309(8): 1963-1966 (2009) |
| 2008 |
| 22 |  | Siham Bekkai,
Mekkia Kouider:
On Mean Distance and Girth
CoRR abs/0806.1438: (2008) |
| 2007 |
| 21 |  | David Forge,
Mekkia Kouider:
Coverings of the Vertices of a Graph by Small Cycles.
Graphs and Combinatorics 23(2): 135-143 (2007) |
| 20 |  | Amine El Sahili,
Mekkia Kouider:
About paths with two blocks.
Journal of Graph Theory 55(3): 221-226 (2007) |
| 2006 |
| 19 |  | Mekkia Kouider,
Manouchehr Zaker:
Bounds for the b-chromatic number of some families of graphs.
Discrete Mathematics 306(7): 617-623 (2006) |
| 18 |  | Mekkia Kouider,
Preben D. Vestergaard:
Generalized connected domination in graphs.
Discrete Mathematics & Theoretical Computer Science 8(1): 57-64 (2006) |
| 2005 |
| 17 |  | Chính T. Hoàng,
Mekkia Kouider:
On the b-dominating coloring of graphs.
Discrete Applied Mathematics 152(1-3): 176-186 (2005) |
| 16 |  | Mekkia Kouider,
Preben D. Vestergaard:
Connected Factors in Graphs - a Survey.
Graphs and Combinatorics 21(1): 1-26 (2005) |
| 2004 |
| 15 |  | Mekkia Kouider,
Zbigniew Lonc:
Stability number and [a, b]-factors in graphs.
Journal of Graph Theory 46(4): 254-264 (2004) |
| 2003 |
| 14 |  | Selma Djelloul,
Mekkia Kouider:
Minimum survivable graphs with bounded distance increase.
Discrete Mathematics & Theoretical Computer Science 6(1): 123-132 (2003) |
| 2002 |
| 13 |  | Mekkia Kouider,
Maryvonne Mahéo:
Connected [a, b]-factors in Graphs.
Combinatorica 22(1): 71-82 (2002) |
| 12 |  | Mekkia Kouider,
Antoni Marczyk:
On pancyclism in hamiltonian graphs.
Discrete Mathematics 251(1-3): 119-127 (2002) |
| 11 |  | Mekkia Kouider,
Maryvonne Mahéo:
Some bounds for the b-chromatic number of a grap.
Discrete Mathematics 256(1-2): 267-277 (2002) |
| 2001 |
| 10 |  | Ahmed Ainouche,
Mekkia Kouider:
Cycles in Partially Square Graphs.
Graphs and Combinatorics 17(1): 1-9 (2001) |
| 2000 |
| 9 |  | Mekkia Kouider:
Neighborhoods and Covering Vertices by Cycles.
Combinatorica 20(2): 219-226 (2000) |
| 8 |  | Nathaniel Dean,
Mekkia Kouider:
Gallai's conjecture for disconnected graphs.
Discrete Mathematics 213(1-3): 43-54 (2000) |
| 1999 |
| 7 |  | Ahmed Ainouche,
Mekkia Kouider:
Hamiltonism and Partially Square Graphs.
Graphs and Combinatorics 15(3): 257-265 (1999) |
| 1996 |
| 6 |  | Mekkia Kouider,
Zbigniew Lonc:
Covering Cycles and k-Term Degree Sums.
Combinatorica 16(3): 407-412 (1996) |
| 1995 |
| 5 |  | Mekkia Kouider,
Gert Sabidussi:
Factorizations of 4-Regular Graphs and Petersen's Theorem.
J. Comb. Theory, Ser. B 63(2): 170-184 (1995) |
| 1994 |
| 4 |  | Mekkia Kouider:
Cycles in Graphs with Prescribed Stability Number and Connectivity.
J. Comb. Theory, Ser. B 60(2): 315-318 (1994) |
| 1989 |
| 3 |  | Mekkia Kouider,
Dominique Sotteau:
On the existence of a matching orthogonal to a 2-factorization.
Discrete Mathematics 73(3): 301-304 (1989) |
| 1988 |
| 2 |  | J. A. Bondy,
Mekkia Kouider:
Hamilton cycles in regular 2-connected graphs.
J. Comb. Theory, Ser. B 44(2): 177-186 (1988) |
| 1983 |
| 1 |  | François Jaeger,
Charles Payan,
Mekkia Kouider:
Partition of odd regular graphs into bistars.
Discrete Mathematics 46(1): 93-94 (1983) |