{
  "id": "1904.01600",
  "version": "v1",
  "published": "2019-04-02T18:04:36.000Z",
  "updated": "2019-04-02T18:04:36.000Z",
  "title": "New bounds for the b-chromatic number of vertex deleted graphs",
  "authors": [
    "Renata Del-Vecchio",
    "Mekkia Kouider"
  ],
  "categories": [
    "math.CO"
  ],
  "abstract": "A b-coloring of a graph is a proper coloring of its vertices such that each color class contains a vertex adjacent to at least one vertex of every other color class. The b-chromatic number of a graph is the largest integer k such that the graph has a b-coloring with k colors. In this work we present lower bounds for the b-chromatic number of a vertex-deleted subgraph of a graph, particularly regarding two important classes, quasi-line and chordal graphs. We also get bounds for the b-chromatic number of G -{x}, when G is a graph with large girth.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2019-04-02T18:04:36.000Z"
    }
  ],
  "analyses": {
    "subjects": [
      "05C15"
    ],
    "keywords": [
      "b-chromatic number",
      "vertex deleted graphs",
      "color class contains",
      "vertex adjacent",
      "largest integer"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 0,
      "language": "en",
      "license": "arXiv",
      "status": "editable"
    }
  }
}