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

Simple item page
dc.creatorKouider, Mekkia
dc.creatorZaker, Manouchehr
dc.date2005-06-09
dc.date.accessioned2026-07-07T05:20:38Z
dc.date.available2026-07-07T05:20:38Z
dc.descriptionIn 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 terms of either clique number or chromatic number of graphs or biclique number for bipartite graphs. We show that all the bounds are tight.
dc.description10 pages
dc.identifierhttps://arxiv.org/abs/math/0506167
dc.identifierhttp://arxiv.org/abs/math/0506167
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/75445
dc.subjectCombinatorics
dc.subject05C15
dc.titleBounds for the $b$-chromatic number of some families of graphs
dc.typetext

Files

Collections

arXiv