Bounds for the b-Chromatic Number of Subgraphs and Edge-Deleted Subgraphs

Open access

Abstract

A b-coloring of a graph G with k colors is a proper coloring of G using k colors in which each color class contains a color dominating vertex, that is, a vertex which has a neighbor in each of the other color classes. The largest positive integer k for which G has a b-coloring using k colors is the b-chromatic number b(G) of G. In this paper, we obtain bounds for the b- chromatic number of induced subgraphs in terms of the b-chromatic number of the original graph. This turns out to be a generalization of the result due to R. Balakrishnan et al. [Bounds for the b-chromatic number of G−v, Discrete Appl. Math. 161 (2013) 1173-1179]. Also we show that for any connected graph G and any e ∈ E(G), b(G - e) ≤ b(G) + -2. Further, we determine all graphs which attain the upper bound. Finally, we conclude by finding bound for the b-chromatic number of any subgraph.

If the inline PDF is not rendering correctly, you can download the PDF file here.

  • [1] R. Balakrishnan and S. Francis Raj Bounds for the b-chromatic number of G − v Discrete Appl. Math. 161 (2013) 1173-1179. doi:

    • Crossref
    • Export Citation
  • [2] D. Barth J. Cohen and T. Faik On the b-continuity property of graphs Discrete Appl. Math. 155(2007) 1761-1768. doi:

    • Crossref
    • Export Citation
  • [3] M. Blidia N.I. Eschouf and F. Maffray b-coloring of some bipartite graphs Aus- tralas. J. Combin. 53 (2012) 67-76.

  • [4] S. Corteel M. Valencia-Pabon and J.-C. Vera On approximating the b-chromatic number Discrete Appl. Math. 146 (2005) 106-110. doi:

    • Crossref
    • Export Citation
  • [5] B. Effantin and H. Kheddouci The b-chromatic number of some power graphs Dis- crete Math. Theor. Comput. Sci. 6 (2003) 45-54.

  • [6] T. Faik About the b-continuity of graph Electron. Notes Discrete Math. 17 (2004) 151-156. doi:

    • Crossref
    • Export Citation
  • [7] T. Faik La b-continuite des b-colorations: complexité propriétés structurelles et algorithmes Ph.D. Thesis (University of Paris XI Orsay 2005).

  • [8] C.T. Hoàng and M. Kouider On the b-dominating coloring of graphs Discrete Appl. Math. 152 (2005) 176-186. doi:

    • Crossref
    • Export Citation
  • [9] R.W. Irving and D.F. Manlove The b-chromatic number of a graph Discrete Appl.Math. 91 (1999) 127-141. doi:

    • Crossref
    • Export Citation
  • [10] M. Jakovac and S. Klavžar The b-chromatic number of cubic graphs Graphs Com- bin. 26 (2010) 107-118. doi:

    • Crossref
    • Export Citation
  • [11] M. Kouider and M. Mahéo Some bounds for the b-chromatic number of a graph Discrete Math. 256 (2002) 267-277. doi:

    • Crossref
    • Export Citation
  • [12] M. Kouider and M. Zaker Bounds for the b-chromatic number of some families of graphs Discrete Math. 306 (2006) 617-623. doi:

    • Crossref
    • Export Citation
  • [13] J. Kratochvíl Zs. Tuza and M. VoigtOn the b-chromatic number of graphs Lecture Notes in Comput. Sci. 2573 (2002) 310-320. doi:

    • Crossref
    • Export Citation
  • [14] F. Maffray and A. Silva b-colouring outerplanar graphs with large girth Discrete Math. 312 (2012) 1796-1803. doi:

    • Crossref
    • Export Citation
Search
Journal information
Impact Factor
IMPACT FACTOR 2018: 0.741
5-year IMPACT FACTOR: 0.611

CiteScore 2018: 0.73

SCImago Journal Rank (SJR) 2018: 0.763
Source Normalized Impact per Paper (SNIP) 2018: 0.934

Mathematical Citation Quotient (MCQ) 2017: 0.36

Target audience:

researchers in the fields of: colourings, partitions (general colourings), hereditary properties, independence and dominating structures (sets, paths, cycles, etc.), cycles, local properties, products of graphs

Metrics
All Time Past Year Past 30 Days
Abstract Views 0 0 0
Full Text Views 158 106 1
PDF Downloads 73 41 1