M. Zaker

most citedBounds for the

b

-chromatic number of some families of graphs

3 citations · 3 across the 2 of their papers we have counts for

collaborators

Showing math.COShow all

2 papers · 1 filter

math.CO2008

More results on greedy defining sets

Manouchehr Zaker

The greedy defining sets of graphs were appeared first time in [M. Zaker, Greedy defining sets of graphs, Australas. J. Combin, 2001]. We show that to determine the greedy defining…

math.CO2005★ 3 cited

Bounds for the $b$ -chromatic number of some families of graphs

Mekkia Kouider, Manouchehr Zaker

In this paper we obtain some upper bounds for $b$ -chromatic number of $K_{1, t}$ -free graphs, graphs with given minimum clique partition and bipartite graphs. These bounds are in t…

More results on greedy defining sets

Bounds for the b-chromatic number of some families of graphs

Bounds for the $b$ -chromatic number of some families of graphs