default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMekkia Kouider
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[j46]Renata R. Del-Vecchio
, Mekkia Kouider:
New bounds for the b-chromatic number of vertex deleted graphs. Discret. Appl. Math. 306: 108-113 (2022)- [i2]Mekkia Kouider, Mohamed Zamime:
On the path partition of graphs. CoRR abs/2212.12793 (2022)
2010 – 2019
- 2018
- [j45]Selma Djelloul, Odile Favaron, Mekkia Kouider:
Edge k-q-Colorability of Graphs. J. Graph Algorithms Appl. 22(2): 193-206 (2018) - 2017
- [j44]Mekkia Kouider, Mohamed Zamime:
On the b-coloring of tight graphs. J. Comb. Optim. 33(1): 202-214 (2017) - 2016
- [j43]Mekkia Kouider:
On quasi-monotonous graphs. Discret. Appl. Math. 198: 155-163 (2016) - 2015
- [j42]Mohamed Zamime, Mekkia Kouider, Hacène Aït Haddadène:
On the b-coloring of G-e. Discret. Appl. Math. 188: 41-50 (2015) - [j41]Amine El Sahili, Mekkia Kouider, Maidoun Mortada:
On the b-chromatic number of regular bounded graphs. Discret. Appl. Math. 193: 174-179 (2015) - 2014
- [j40]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: 79-85 (2014) - [j39]Mekkia Kouider:
Stability Number and f-Factors in Graphs. Graphs Comb. 30(1): 197-202 (2014) - [j38]Odile Favaron, Mekkia Kouider:
Even Factors of Large Size. J. Graph Theory 77(1): 58-67 (2014) - 2013
- [j37]Mekkia Kouider, Saliha Ouatiki:
Sufficient Condition for the Existence of an Even [a, b]-Factor in Graph. Graphs Comb. 29(4): 1051-1057 (2013) - 2011
- [j36]Mekkia Kouider, Mario Valencia-Pabon:
On lower bounds for the b-chromatic number of connected bipartite graphs. Electron. Notes Discret. Math. 37: 399-404 (2011) - 2010
- [j35]Siham Bekkai, Mekkia Kouider:
On mean distance and girth. Discret. Appl. Math. 158(17): 1888-1893 (2010) - [j34]Odile Favaron, François Genest, Mekkia Kouider:
Regular path decompositions of odd regular graphs. J. Graph Theory 63(2): 114-128 (2010) - [i1]Mekkia Kouider:
Stability number and f-factors in graphs. CoRR abs/1011.0636 (2010)
2000 – 2009
- 2009
- [j33]Siham Bekkai, Mekkia Kouider:
On pseudo 2-factors. Discret. Appl. Math. 157(4): 774-779 (2009) - [j32]Siham Bekkai, David Forge, Mekkia Kouider:
Covering the vertices of a graph with cycles of bounded length. Discret. Math. 309(8): 1963-1966 (2009) - 2007
- [j31]David Forge, Mekkia Kouider:
Coverings of the Vertices of a Graph by Small Cycles. Graphs Comb. 23(2): 135-143 (2007) - [j30]Amine El Sahili, Mekkia Kouider:
About paths with two blocks. J. Graph Theory 55(3): 221-226 (2007) - 2006
- [j29]Mekkia Kouider, Manouchehr Zaker:
Bounds for the b-chromatic number of some families of graphs. Discret. Math. 306(7): 617-623 (2006) - [j28]Mekkia Kouider, Preben D. Vestergaard:
Generalized connected domination in graphs. Discret. Math. Theor. Comput. Sci. 8(1): 57-64 (2006) - 2005
- [j27]Chính T. Hoàng, Mekkia Kouider:
On the b-dominating coloring of graphs. Discret. Appl. Math. 152(1-3): 176-186 (2005) - [j26]Mekkia Kouider, Preben D. Vestergaard:
Connected Factors in Graphs - a Survey. Graphs Comb. 21(1): 1-26 (2005) - 2004
- [j25]Mekkia Kouider, Preben D. Vestergaard:
Even [a, b]-factors in graphs. Discuss. Math. Graph Theory 24(3): 431-441 (2004) - [j24]Mekkia Kouider, Zbigniew Lonc:
Stability number and [a, b]-factors in graphs. J. Graph Theory 46(4): 254-264 (2004) - 2003
- [j23]Mekkia Kouider, Preben D. Vestergaard:
On even [2, b]-factors in graphs. Australas. J Comb. 27: 139-148 (2003) - [j22]Selma Djelloul, Mekkia Kouider:
Minimum survivable graphs with bounded distance increase. Discret. Math. Theor. Comput. Sci. 6(1): 123-132 (2003) - 2002
- [j21]Mekkia Kouider, Maryvonne Mahéo:
Connected [a, b]-factors in Graphs. Comb. 22(1): 71-82 (2002) - [j20]Mekkia Kouider, Antoni Marczyk:
On pancyclism in hamiltonian graphs. Discret. Math. 251(1-3): 119-127 (2002) - [j19]Mekkia Kouider, Maryvonne Mahéo:
Some bounds for the b-chromatic number of a grap. Discret. Math. 256(1-2): 267-277 (2002) - 2001
- [j18]Selma Djelloul, Mekkia Kouider:
On weighted mean distance. Australas. J Comb. 23: 181-196 (2001) - [j17]Ahmed Ainouche, Mekkia Kouider:
Cycles in Partially Square Graphs. Graphs Comb. 17(1): 1-9 (2001) - 2000
- [j16]Mekkia Kouider:
Neighborhoods and Covering Vertices by Cycles. Comb. 20(2): 219-226 (2000) - [j15]Nathaniel Dean, Mekkia Kouider:
Gallai's conjecture for disconnected graphs. Discret. Math. 213(1-3): 43-54 (2000)
1990 – 1999
- 1999
- [j14]Mekkia Kouider, Zbigniew Lonc:
Path decompositions and perfect path double covers. Australas. J Comb. 19: 261-274 (1999) - [j13]Ahmed Ainouche, Mekkia Kouider:
Hamiltonism and Partially Square Graphs. Graphs Comb. 15(3): 257-265 (1999) - [j12]Mekkia Kouider, Peter Winkler:
Erratum: Mean distance and minimum degree. J. Graph Theory 30(3): 243 (1999) - 1998
- [j11]Krzysztof Brys, Mekkia Kouider, Zbigniew Lonc, Maryvonne Mahéo:
Decomposition of multigraphs. Discuss. Math. Graph Theory 18(2): 225-232 (1998) - 1997
- [j10]Mekkia Kouider, Peter Winkler:
Mean distance and minimum degree. J. Graph Theory 25(1): 95-99 (1997) - 1996
- [j9]Mekkia Kouider, Zbigniew Lonc:
Covering Cycles and k-Term Degree Sums. Comb. 16(3): 407-412 (1996) - 1995
- [j8]Mekkia Kouider, Gert Sabidussi:
Factorizations of 4-Regular Graphs and Petersen's Theorem. J. Comb. Theory B 63(2): 170-184 (1995) - [j7]Hikoe Enomoto, Atsushi Kaneko, Mekkia Kouider, Zsolt Tuza:
Degree Sums and Covering Cycles. J. Graph Theory 20(4): 419-422 (1995) - 1994
- [j6]Mekkia Kouider:
Cycles in Graphs with Prescribed Stability Number and Connectivity. J. Comb. Theory B 60(2): 315-318 (1994) - [j5]Mekkia Kouider:
Covering vertices by cycles. J. Graph Theory 18(8): 757-776 (1994)
1980 – 1989
- 1989
- [j4]Mekkia Kouider, Dominique Sotteau:
On the existence of a matching orthogonal to a 2-factorization. Discret. Math. 73(3): 301-304 (1989) - [j3]Odile Favaron, Mekkia Kouider, Maryvonne Mahéo:
Edge-vulnerability and mean distance. Networks 19(5): 493-504 (1989) - 1988
- [j2]J. Adrian Bondy, Mekkia Kouider:
Hamilton cycles in regular 2-connected graphs. J. Comb. Theory B 44(2): 177-186 (1988) - 1983
- [j1]François Jaeger, Charles Payan, Mekkia Kouider:
Partition of odd regular graphs into bistars. Discret. Math. 46(1): 93-94 (1983)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-10 20:32 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
