Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBibTeX records: Mekkia Kouider
@article{DBLP:journals/dam/Del-VecchioK22,
author = {Renata R. Del{-}Vecchio and
Mekkia Kouider},
title = {New bounds for the b-chromatic number of vertex deleted graphs},
journal = {Discret. Appl. Math.},
volume = {306},
pages = {108--113},
year = {2022},
url = {https://doi.org/10.1016/j.dam.2021.09.023},
doi = {10.1016/J.DAM.2021.09.023},
timestamp = {Wed, 15 Dec 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/Del-VecchioK22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2212-12793,
author = {Mekkia Kouider and
Mohamed Zamime},
title = {On the path partition of graphs},
journal = {CoRR},
volume = {abs/2212.12793},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2212.12793},
doi = {10.48550/ARXIV.2212.12793},
eprinttype = {arXiv},
eprint = {2212.12793},
timestamp = {Mon, 02 Jan 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2212-12793.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/DjelloulFK18,
author = {Selma Djelloul and
Odile Favaron and
Mekkia Kouider},
title = {Edge k-q-Colorability of Graphs},
journal = {J. Graph Algorithms Appl.},
volume = {22},
number = {2},
pages = {193--206},
year = {2018},
url = {https://doi.org/10.7155/jgaa.00464},
doi = {10.7155/JGAA.00464},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/DjelloulFK18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/KouiderZ17,
author = {Mekkia Kouider and
Mohamed Zamime},
title = {On the b-coloring of tight graphs},
journal = {J. Comb. Optim.},
volume = {33},
number = {1},
pages = {202--214},
year = {2017},
url = {https://doi.org/10.1007/s10878-015-9946-y},
doi = {10.1007/S10878-015-9946-Y},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/KouiderZ17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/Kouider16,
author = {Mekkia Kouider},
title = {On quasi-monotonous graphs},
journal = {Discret. Appl. Math.},
volume = {198},
pages = {155--163},
year = {2016},
url = {https://doi.org/10.1016/j.dam.2015.06.001},
doi = {10.1016/J.DAM.2015.06.001},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/Kouider16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/ZamimeKH15,
author = {Mohamed Zamime and
Mekkia Kouider and
Hac{\`{e}}ne A{\"{\i}}t Haddad{\`{e}}ne},
title = {On the b-coloring of G-e},
journal = {Discret. Appl. Math.},
volume = {188},
pages = {41--50},
year = {2015},
url = {https://doi.org/10.1016/j.dam.2015.02.017},
doi = {10.1016/J.DAM.2015.02.017},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/ZamimeKH15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/SahiliKM15,
author = {Amine El Sahili and
Mekkia Kouider and
Maidoun Mortada},
title = {On the b-chromatic number of regular bounded graphs},
journal = {Discret. Appl. Math.},
volume = {193},
pages = {174--179},
year = {2015},
url = {https://doi.org/10.1016/j.dam.2015.04.017},
doi = {10.1016/J.DAM.2015.04.017},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/SahiliKM15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/SahiliKKM14,
author = {Amine El Sahili and
Hamamache Kheddouci and
Mekkia Kouider and
Maidoun Mortada},
title = {The b-chromatic number and f-chromatic vertex number of regular graphs},
journal = {Discret. Appl. Math.},
volume = {179},
pages = {79--85},
year = {2014},
url = {https://doi.org/10.1016/j.dam.2014.07.011},
doi = {10.1016/J.DAM.2014.07.011},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/SahiliKKM14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/gc/Kouider14,
author = {Mekkia Kouider},
title = {Stability Number and f-Factors in Graphs},
journal = {Graphs Comb.},
volume = {30},
number = {1},
pages = {197--202},
year = {2014},
url = {https://doi.org/10.1007/s00373-012-1250-3},
doi = {10.1007/S00373-012-1250-3},
timestamp = {Thu, 04 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/gc/Kouider14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/FavaronK14,
author = {Odile Favaron and
Mekkia Kouider},
title = {Even Factors of Large Size},
journal = {J. Graph Theory},
volume = {77},
number = {1},
pages = {58--67},
year = {2014},
url = {https://doi.org/10.1002/jgt.21773},
doi = {10.1002/JGT.21773},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/FavaronK14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/gc/KouiderO13,
author = {Mekkia Kouider and
Saliha Ouatiki},
title = {Sufficient Condition for the Existence of an Even [a, b]-Factor in
Graph},
journal = {Graphs Comb.},
volume = {29},
number = {4},
pages = {1051--1057},
year = {2013},
url = {https://doi.org/10.1007/s00373-012-1168-9},
doi = {10.1007/S00373-012-1168-9},
timestamp = {Thu, 04 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/gc/KouiderO13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/KouiderV11,
author = {Mekkia Kouider and
Mario Valencia{-}Pabon},
title = {On lower bounds for the b-chromatic number of connected bipartite
graphs},
journal = {Electron. Notes Discret. Math.},
volume = {37},
pages = {399--404},
year = {2011},
url = {https://doi.org/10.1016/j.endm.2011.05.068},
doi = {10.1016/J.ENDM.2011.05.068},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/endm/KouiderV11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/BekkaiK10,
author = {Siham Bekkai and
Mekkia Kouider},
title = {On mean distance and girth},
journal = {Discret. Appl. Math.},
volume = {158},
number = {17},
pages = {1888--1893},
year = {2010},
url = {https://doi.org/10.1016/j.dam.2010.06.013},
doi = {10.1016/J.DAM.2010.06.013},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/BekkaiK10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/FavaronGK10,
author = {Odile Favaron and
Fran{\c{c}}ois Genest and
Mekkia Kouider},
title = {Regular path decompositions of odd regular graphs},
journal = {J. Graph Theory},
volume = {63},
number = {2},
pages = {114--128},
year = {2010},
url = {https://doi.org/10.1002/jgt.20413},
doi = {10.1002/JGT.20413},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/FavaronGK10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1011-0636,
author = {Mekkia Kouider},
title = {Stability number and f-factors in graphs},
journal = {CoRR},
volume = {abs/1011.0636},
year = {2010},
url = {http://arxiv.org/abs/1011.0636},
eprinttype = {arXiv},
eprint = {1011.0636},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1011-0636.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/BekkaiK09,
author = {Siham Bekkai and
Mekkia Kouider},
title = {On pseudo 2-factors},
journal = {Discret. Appl. Math.},
volume = {157},
number = {4},
pages = {774--779},
year = {2009},
url = {https://doi.org/10.1016/j.dam.2008.07.002},
doi = {10.1016/J.DAM.2008.07.002},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/BekkaiK09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/BekkaiFK09,
author = {Siham Bekkai and
David Forge and
Mekkia Kouider},
title = {Covering the vertices of a graph with cycles of bounded length},
journal = {Discret. Math.},
volume = {309},
number = {8},
pages = {1963--1966},
year = {2009},
url = {https://doi.org/10.1016/j.disc.2008.03.031},
doi = {10.1016/J.DISC.2008.03.031},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/BekkaiFK09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/gc/ForgeK07,
author = {David Forge and
Mekkia Kouider},
title = {Coverings of the Vertices of a Graph by Small Cycles},
journal = {Graphs Comb.},
volume = {23},
number = {2},
pages = {135--143},
year = {2007},
url = {https://doi.org/10.1007/s00373-006-0678-8},
doi = {10.1007/S00373-006-0678-8},
timestamp = {Thu, 04 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/gc/ForgeK07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/SahiliK07,
author = {Amine El Sahili and
Mekkia Kouider},
title = {About paths with two blocks},
journal = {J. Graph Theory},
volume = {55},
number = {3},
pages = {221--226},
year = {2007},
url = {https://doi.org/10.1002/jgt.20222},
doi = {10.1002/JGT.20222},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/SahiliK07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/KouiderZ06,
author = {Mekkia Kouider and
Manouchehr Zaker},
title = {Bounds for the b-chromatic number of some families of graphs},
journal = {Discret. Math.},
volume = {306},
number = {7},
pages = {617--623},
year = {2006},
url = {https://doi.org/10.1016/j.disc.2006.01.012},
doi = {10.1016/J.DISC.2006.01.012},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/KouiderZ06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dmtcs/KouiderV06,
author = {Mekkia Kouider and
Preben D. Vestergaard},
title = {Generalized connected domination in graphs},
journal = {Discret. Math. Theor. Comput. Sci.},
volume = {8},
number = {1},
pages = {57--64},
year = {2006},
url = {https://doi.org/10.46298/dmtcs.373},
doi = {10.46298/DMTCS.373},
timestamp = {Tue, 24 Jan 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dmtcs/KouiderV06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/HoangK05,
author = {Ch{\'{\i}}nh T. Ho{\`{a}}ng and
Mekkia Kouider},
title = {On the \emph{b}-dominating coloring of graphs},
journal = {Discret. Appl. Math.},
volume = {152},
number = {1-3},
pages = {176--186},
year = {2005},
url = {https://doi.org/10.1016/j.dam.2005.04.001},
doi = {10.1016/J.DAM.2005.04.001},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/HoangK05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/gc/KouiderV05,
author = {Mekkia Kouider and
Preben D. Vestergaard},
title = {Connected Factors in Graphs - a Survey},
journal = {Graphs Comb.},
volume = {21},
number = {1},
pages = {1--26},
year = {2005},
url = {https://doi.org/10.1007/s00373-004-0587-7},
doi = {10.1007/S00373-004-0587-7},
timestamp = {Thu, 04 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/gc/KouiderV05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dmgt/KouiderV04,
author = {Mekkia Kouider and
Preben D. Vestergaard},
title = {Even [a, b]-factors in graphs},
journal = {Discuss. Math. Graph Theory},
volume = {24},
number = {3},
pages = {431--441},
year = {2004},
url = {https://doi.org/10.7151/dmgt.1242},
doi = {10.7151/DMGT.1242},
timestamp = {Mon, 08 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dmgt/KouiderV04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/KouiderL04,
author = {Mekkia Kouider and
Zbigniew Lonc},
title = {Stability number and [\emph{a, b}]-factors in graphs},
journal = {J. Graph Theory},
volume = {46},
number = {4},
pages = {254--264},
year = {2004},
url = {https://doi.org/10.1002/jgt.20008},
doi = {10.1002/JGT.20008},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgt/KouiderL04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ajc/KouiderV03,
author = {Mekkia Kouider and
Preben D. Vestergaard},
title = {On even [2, b]-factors in graphs},
journal = {Australas. {J} Comb.},
volume = {27},
pages = {139--148},
year = {2003},
url = {http://ajc.maths.uq.edu.au/pdf/27/ajc\_v27\_p139.pdf},
timestamp = {Wed, 11 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ajc/KouiderV03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dmtcs/DjelloulK03,
author = {Selma Djelloul and
Mekkia Kouider},
title = {Minimum survivable graphs with bounded distance increase},
journal = {Discret. Math. Theor. Comput. Sci.},
volume = {6},
number = {1},
pages = {123--132},
year = {2003},
url = {https://doi.org/10.46298/dmtcs.338},
doi = {10.46298/DMTCS.338},
timestamp = {Tue, 24 Jan 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dmtcs/DjelloulK03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/KouiderM02,
author = {Mekkia Kouider and
Maryvonne Mah{\'{e}}o},
title = {Connected [a, b]-factors in Graphs},
journal = {Comb.},
volume = {22},
number = {1},
pages = {71--82},
year = {2002},
url = {https://doi.org/10.1007/s004930200004},
doi = {10.1007/S004930200004},
timestamp = {Wed, 22 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorica/KouiderM02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/KouiderM02a,
author = {Mekkia Kouider and
Antoni Marczyk},
title = {On pancyclism in hamiltonian graphs},
journal = {Discret. Math.},
volume = {251},
number = {1-3},
pages = {119--127},
year = {2002},
url = {https://doi.org/10.1016/S0012-365X(01)00333-8},
doi = {10.1016/S0012-365X(01)00333-8},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/KouiderM02a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/KouiderM02,
author = {Mekkia Kouider and
Maryvonne Mah{\'{e}}o},
title = {Some bounds for the \emph{b}-chromatic number of a grap},
journal = {Discret. Math.},
volume = {256},
number = {1-2},
pages = {267--277},
year = {2002},
url = {https://doi.org/10.1016/S0012-365X(01)00469-1},
doi = {10.1016/S0012-365X(01)00469-1},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/KouiderM02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ajc/DjelloulK01,
author = {Selma Djelloul and
Mekkia Kouider},
title = {On weighted mean distance},
journal = {Australas. {J} Comb.},
volume = {23},
pages = {181--196},
year = {2001},
url = {http://ajc.maths.uq.edu.au/pdf/23/ocr-ajc-v23-p181.pdf},
timestamp = {Wed, 11 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ajc/DjelloulK01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/gc/AinoucheK01,
author = {Ahmed Ainouche and
Mekkia Kouider},
title = {Cycles in Partially Square Graphs},
journal = {Graphs Comb.},
volume = {17},
number = {1},
pages = {1--9},
year = {2001},
url = {https://doi.org/10.1007/PL00007232},
doi = {10.1007/PL00007232},
timestamp = {Thu, 04 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/gc/AinoucheK01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/Kouider00,
author = {Mekkia Kouider},
title = {Neighborhoods and Covering Vertices by Cycles},
journal = {Comb.},
volume = {20},
number = {2},
pages = {219--226},
year = {2000},
url = {https://doi.org/10.1007/s004930070021},
doi = {10.1007/S004930070021},
timestamp = {Wed, 22 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorica/Kouider00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/DeanK00,
author = {Nathaniel Dean and
Mekkia Kouider},
title = {Gallai's conjecture for disconnected graphs},
journal = {Discret. Math.},
volume = {213},
number = {1-3},
pages = {43--54},
year = {2000},
url = {https://doi.org/10.1016/S0012-365X(99)00167-3},
doi = {10.1016/S0012-365X(99)00167-3},
timestamp = {Sat, 21 Oct 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dm/DeanK00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ajc/KouiderL99,
author = {Mekkia Kouider and
Zbigniew Lonc},
title = {Path decompositions and perfect path double covers},
journal = {Australas. {J} Comb.},
volume = {19},
pages = {261--274},
year = {1999},
url = {http://ajc.maths.uq.edu.au/pdf/19/ocr-ajc-v19-p261.pdf},
timestamp = {Wed, 11 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ajc/KouiderL99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/gc/AinoucheK99,
author = {Ahmed Ainouche and
Mekkia Kouider},
title = {Hamiltonism and Partially Square Graphs},
journal = {Graphs Comb.},
volume = {15},
number = {3},
pages = {257--265},
year = {1999},
url = {https://doi.org/10.1007/s003730050059},
doi = {10.1007/S003730050059},
timestamp = {Thu, 04 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/gc/AinoucheK99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/KouiderW99,
author = {Mekkia Kouider and
Peter Winkler},
title = {Erratum: Mean distance and minimum degree},
journal = {J. Graph Theory},
volume = {30},
number = {3},
pages = {243},
year = {1999},
url = {https://doi.org/10.1002/(SICI)1097-0118(199903)30:3\&\#60;243::AID-JGT9\&\#62;3.0.CO;2-E},
doi = {10.1002/(SICI)1097-0118(199903)30:3\&\#60;243::AID-JGT9\&\#62;3.0.CO;2-E},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/KouiderW99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dmgt/BrysKLM98,
author = {Krzysztof Brys and
Mekkia Kouider and
Zbigniew Lonc and
Maryvonne Mah{\'{e}}o},
title = {Decomposition of multigraphs},
journal = {Discuss. Math. Graph Theory},
volume = {18},
number = {2},
pages = {225--232},
year = {1998},
url = {https://doi.org/10.7151/dmgt.1078},
doi = {10.7151/DMGT.1078},
timestamp = {Mon, 08 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dmgt/BrysKLM98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/KouiderW97,
author = {Mekkia Kouider and
Peter Winkler},
title = {Mean distance and minimum degree},
journal = {J. Graph Theory},
volume = {25},
number = {1},
pages = {95--99},
year = {1997},
url = {https://doi.org/10.1002/(SICI)1097-0118(199705)25:1\&\#60;95::AID-JGT7\&\#62;3.0.CO;2-D},
doi = {10.1002/(SICI)1097-0118(199705)25:1\&\#60;95::AID-JGT7\&\#62;3.0.CO;2-D},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/KouiderW97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/KouiderL96,
author = {Mekkia Kouider and
Zbigniew Lonc},
title = {Covering Cycles and \emph{k}-Term Degree Sums},
journal = {Comb.},
volume = {16},
number = {3},
pages = {407--412},
year = {1996},
url = {https://doi.org/10.1007/BF01261324},
doi = {10.1007/BF01261324},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/combinatorica/KouiderL96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/KouiderS95,
author = {Mekkia Kouider and
Gert Sabidussi},
title = {Factorizations of 4-Regular Graphs and Petersen's Theorem},
journal = {J. Comb. Theory, Ser. {B}},
volume = {63},
number = {2},
pages = {170--184},
year = {1995},
url = {https://doi.org/10.1006/jctb.1995.1014},
doi = {10.1006/JCTB.1995.1014},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jct/KouiderS95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/EnomotoKKT95,
author = {Hikoe Enomoto and
Atsushi Kaneko and
Mekkia Kouider and
Zsolt Tuza},
title = {Degree Sums and Covering Cycles},
journal = {J. Graph Theory},
volume = {20},
number = {4},
pages = {419--422},
year = {1995},
url = {https://doi.org/10.1002/jgt.3190200405},
doi = {10.1002/JGT.3190200405},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/EnomotoKKT95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/Kouider94,
author = {Mekkia Kouider},
title = {Cycles in Graphs with Prescribed Stability Number and Connectivity},
journal = {J. Comb. Theory, Ser. {B}},
volume = {60},
number = {2},
pages = {315--318},
year = {1994},
url = {https://doi.org/10.1006/jctb.1994.1023},
doi = {10.1006/JCTB.1994.1023},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jct/Kouider94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/Kouider94,
author = {Mekkia Kouider},
title = {Covering vertices by cycles},
journal = {J. Graph Theory},
volume = {18},
number = {8},
pages = {757--776},
year = {1994},
url = {https://doi.org/10.1002/jgt.3190180802},
doi = {10.1002/JGT.3190180802},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/Kouider94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/KouiderS89,
author = {Mekkia Kouider and
Dominique Sotteau},
title = {On the existence of a matching orthogonal to a 2-factorization},
journal = {Discret. Math.},
volume = {73},
number = {3},
pages = {301--304},
year = {1989},
url = {https://doi.org/10.1016/0012-365X(89)90274-4},
doi = {10.1016/0012-365X(89)90274-4},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/KouiderS89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/FavaronKM89,
author = {Odile Favaron and
Mekkia Kouider and
Maryvonne Mah{\'{e}}o},
title = {Edge-vulnerability and mean distance},
journal = {Networks},
volume = {19},
number = {5},
pages = {493--504},
year = {1989},
url = {https://doi.org/10.1002/net.3230190502},
doi = {10.1002/NET.3230190502},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/FavaronKM89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/BondyK88,
author = {J. Adrian Bondy and
Mekkia Kouider},
title = {Hamilton cycles in regular 2-connected graphs},
journal = {J. Comb. Theory, Ser. {B}},
volume = {44},
number = {2},
pages = {177--186},
year = {1988},
url = {https://doi.org/10.1016/0095-8956(88)90086-X},
doi = {10.1016/0095-8956(88)90086-X},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jct/BondyK88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/JaegerPK83,
author = {Fran{\c{c}}ois Jaeger and
Charles Payan and
Mekkia Kouider},
title = {Partition of odd regular graphs into bistars},
journal = {Discret. Math.},
volume = {46},
number = {1},
pages = {93--94},
year = {1983},
url = {https://doi.org/10.1016/0012-365X(83)90275-3},
doi = {10.1016/0012-365X(83)90275-3},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/JaegerPK83.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of 
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.
last updated on 2024-04-25 05:57 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:
