The SCEAS System
| |||||||

## Search the dblp DataBase
Mekkia Kouider:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- Mekkia Kouider
**Neighborhoods and Covering Vertices by Cycles.**[Citation Graph (0, 0)][DBLP] Combinatorica, 2000, v:20, n:2, pp:219-226 [Journal] - Mekkia Kouider, Zbigniew Lonc
**Covering Cycles and**[Citation Graph (0, 0)][DBLP]*k*-Term Degree Sums. Combinatorica, 1996, v:16, n:3, pp:407-412 [Journal] - Mekkia Kouider, Maryvonne Mahéo
**Connected [a, b]-factors in Graphs.**[Citation Graph (0, 0)][DBLP] Combinatorica, 2002, v:22, n:1, pp:71-82 [Journal] - Chính T. Hoàng, Mekkia Kouider
**On the**[Citation Graph (0, 0)][DBLP]*b*-dominating coloring of graphs. Discrete Applied Mathematics, 2005, v:152, n:1-3, pp:176-186 [Journal] - Nathaniel Dean, Mekkia Kouider
**Gallai's conjecture for disconnected graphs.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 2000, v:213, n:1-3, pp:43-54 [Journal] - Mekkia Kouider, Maryvonne Mahéo
**Some bounds for the**[Citation Graph (0, 0)][DBLP]*b*-chromatic number of a grap. Discrete Mathematics, 2002, v:256, n:1-2, pp:267-277 [Journal] - Mekkia Kouider, Antoni Marczyk
**On pancyclism in hamiltonian graphs.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 2002, v:251, n:1-3, pp:119-127 [Journal] - Mekkia Kouider, Manouchehr Zaker
**Bounds for the b-chromatic number of some families of graphs.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 2006, v:306, n:7, pp:617-623 [Journal] - Selma Djelloul, Mekkia Kouider
**Minimum survivable graphs with bounded distance increase.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics & Theoretical Computer Science, 2003, v:6, n:1, pp:123-132 [Journal] - Ahmed Ainouche, Mekkia Kouider
**Cycles in Partially Square Graphs.**[Citation Graph (0, 0)][DBLP] Graphs and Combinatorics, 2001, v:17, n:1, pp:1-9 [Journal] - Mekkia Kouider, Preben D. Vestergaard
**Connected Factors in Graphs - a Survey.**[Citation Graph (0, 0)][DBLP] Graphs and Combinatorics, 2005, v:21, n:1, pp:1-26 [Journal] - J. A. Bondy, Mekkia Kouider
**Hamilton cycles in regular 2-connected graphs.**[Citation Graph (0, 0)][DBLP] J. Comb. Theory, Ser. B, 1988, v:44, n:2, pp:177-186 [Journal] - Mekkia Kouider
**Cycles in Graphs with Prescribed Stability Number and Connectivity.**[Citation Graph (0, 0)][DBLP] J. Comb. Theory, Ser. B, 1994, v:60, n:2, pp:315-318 [Journal] - Mekkia Kouider, Gert Sabidussi
**Factorizations of 4-Regular Graphs and Petersen's Theorem.**[Citation Graph (0, 0)][DBLP] J. Comb. Theory, Ser. B, 1995, v:63, n:2, pp:170-184 [Journal] - Mekkia Kouider, Zbigniew Lonc
**Stability number and [**[Citation Graph (0, 0)][DBLP]*a, b*]-factors in graphs. Journal of Graph Theory, 2004, v:46, n:4, pp:254-264 [Journal] - François Jaeger, Charles Payan, Mekkia Kouider
**Partition of odd regular graphs into bistars.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1983, v:46, n:1, pp:93-94 [Journal] - Mekkia Kouider, Dominique Sotteau
**On the existence of a matching orthogonal to a 2-factorization.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1989, v:73, n:3, pp:301-304 [Journal] - Mekkia Kouider, Preben D. Vestergaard
**Generalized connected domination in graphs.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics & Theoretical Computer Science, 2006, v:8, n:1, pp:57-64 [Journal] **On Mean Distance and Girth**[Citation Graph (, )][DBLP]**On pseudo 2-factors.**[Citation Graph (, )][DBLP]**Covering the vertices of a graph with cycles of bounded length.**[Citation Graph (, )][DBLP]
Search in 0.004secs, Finished in 0.005secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |