{
  "id": "math/0506167",
  "version": "v1",
  "published": "2005-06-09T11:59:05.000Z",
  "updated": "2005-06-09T11:59:05.000Z",
  "title": "Bounds for the $b$-chromatic number of some families of graphs",
  "authors": [
    "Mekkia Kouider",
    "Manouchehr Zaker"
  ],
  "comment": "10 pages",
  "categories": [
    "math.CO"
  ],
  "abstract": "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 terms of either clique number or chromatic number of graphs or biclique number for bipartite graphs. We show that all the bounds are tight.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2005-06-09T11:59:05.000Z"
    }
  ],
  "analyses": {
    "subjects": [
      "05C15"
    ],
    "keywords": [
      "chromatic number",
      "bipartite graphs",
      "minimum clique partition",
      "upper bounds",
      "free graphs"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 10,
      "language": "en",
      "license": "arXiv",
      "status": "editable",
      "adsabs": "2005math......6167K"
    }
  }
}