Mekkia Kouider

According to our database1, Mekkia Kouider authored at least 47 papers between 1983 and 2022.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2022
New bounds for the b-chromatic number of vertex deleted graphs.
Discret. Appl. Math., 2022

On the path partition of graphs.
CoRR, 2022

2018
Edge k-q-Colorability of Graphs.
J. Graph Algorithms Appl., 2018

2017
On the b-coloring of tight graphs.
J. Comb. Optim., 2017

2016
On quasi-monotonous graphs.
Discret. Appl. Math., 2016

2015
On the b-coloring of G-e.
Discret. Appl. Math., 2015

On the b-chromatic number of regular bounded graphs.
Discret. Appl. Math., 2015

2014
Even Factors of Large Size.
J. Graph Theory, 2014

Stability Number and f-Factors in Graphs.
Graphs Comb., 2014

The b-chromatic number and f-chromatic vertex number of regular graphs.
Discret. Appl. Math., 2014

2013
Sufficient Condition for the Existence of an Even [a, b]-Factor in Graph.
Graphs Comb., 2013

2011
On lower bounds for the b-chromatic number of connected bipartite graphs.
Electron. Notes Discret. Math., 2011

2010
Regular path decompositions of odd regular graphs.
J. Graph Theory, 2010

On mean distance and girth.
Discret. Appl. Math., 2010

2009
Covering the vertices of a graph with cycles of bounded length.
Discret. Math., 2009

On pseudo 2-factors.
Discret. Appl. Math., 2009

2007
About paths with two blocks.
J. Graph Theory, 2007

Coverings of the Vertices of a Graph by Small Cycles.
Graphs Comb., 2007

2006
Generalized connected domination in graphs.
Discret. Math. Theor. Comput. Sci., 2006

Bounds for the b-chromatic number of some families of graphs.
Discret. Math., 2006

2005
Connected Factors in Graphs - a Survey.
Graphs Comb., 2005

On the <i>b</i>-dominating coloring of graphs.
Discret. Appl. Math., 2005

2004
Stability number and [<i>a, b</i>]-factors in graphs.
J. Graph Theory, 2004

Even [a, b]-factors in graphs.
Discuss. Math. Graph Theory, 2004

2003
Minimum survivable graphs with bounded distance increase.
Discret. Math. Theor. Comput. Sci., 2003

On even [2, b]-factors in graphs.
Australas. J Comb., 2003

2002
On pancyclism in hamiltonian graphs.
Discret. Math., 2002

Some bounds for the <i>b</i>-chromatic number of a grap.
Discret. Math., 2002

Connected [a, b]-factors in Graphs.
Comb., 2002

2001
Cycles in Partially Square Graphs.
Graphs Comb., 2001

On weighted mean distance.
Australas. J Comb., 2001

2000
Gallai's conjecture for disconnected graphs.
Discret. Math., 2000

Neighborhoods and Covering Vertices by Cycles.
Comb., 2000

1999
Erratum: Mean distance and minimum degree.
J. Graph Theory, 1999

Hamiltonism and Partially Square Graphs.
Graphs Comb., 1999

Path decompositions and perfect path double covers.
Australas. J Comb., 1999

1998
Decomposition of multigraphs.
Discuss. Math. Graph Theory, 1998

1997
Mean distance and minimum degree.
J. Graph Theory, 1997

1996
Covering Cycles and <i>k</i>-Term Degree Sums.
Comb., 1996

1995
Degree Sums and Covering Cycles.
J. Graph Theory, 1995

Factorizations of 4-Regular Graphs and Petersen's Theorem.
J. Comb. Theory, Ser. B, 1995

1994
Covering vertices by cycles.
J. Graph Theory, 1994

Cycles in Graphs with Prescribed Stability Number and Connectivity.
J. Comb. Theory, Ser. B, 1994

1989
Edge-vulnerability and mean distance.
Networks, 1989

On the existence of a matching orthogonal to a 2-factorization.
Discret. Math., 1989

1988
Hamilton cycles in regular 2-connected graphs.
J. Comb. Theory, Ser. B, 1988

1983
Partition of odd regular graphs into bistars.
Discret. Math., 1983


  Loading...