Skip to main content
Log in

Abstract

The b-chromatic index \(\varphi '(G)\) of a graph \(G\) is the largest integer \(k\) such that \(G\) admits a proper \(k\)-edge coloring in which every color class contains at least one edge incident to some edge in all the other color classes. The b-chromatic index of trees is determined and equals either to a natural upper bound \(m'(T)\) or one less, where \(m'(T)\) is connected with the number of edges of high degree. Some conditions are given for which graphs have the b-chromatic index strictly less than \(m'(G)\), and for which conditions it is exactly \(m'(G)\). In the last part of the paper, regular graphs are considered. It is proved that with four exceptions, the b-chromatic index of cubic graphs is \(5\). The exceptions are \(K_4\), \(K_{3,3}\), the prism over \(K_3\), and the cube \(Q_3\).

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8

Similar content being viewed by others

References

  1. Balakrishnan, R., Francis Raj, S.: Bounds for the \(b\)-chromatic number of the Mycielskian of some families of graphs. Ars Combin. (2009)

  2. Balakrishnan, R., Francis Raj, S.: Bounds for the \(b\)-chromatic number of \(G-v\). Discret. Appl. Math. 159, 1013–1021 (2011). doi: 10.1016/j.dam.2011.08.022

    Article  Google Scholar 

  3. Balakrishnan, R., Francis Raj, S., Kavaskar, T.: Coloring the Mycielskian, Proceedings of the International Conference ICDM, pp.53–57. Springer, Berlin (2008)

  4. Barth, D., Cohen, J., Faik, T.: On the b-continuity property of graphs. Discret. Appl. Math. 155, 1761–1768 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  5. Cabello, S., Jakovac, M.: On the b-chromatic number of regular graphs. Discret. Appl. Math. 159, 1303–1310 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  6. Chaouche, F., Berrachedi, A.: Some bounds for the b-chromatic number of a generalized Hamming graphs. Far East J. Appl. Math. 26, 375–391 (2007)

    MathSciNet  MATH  Google Scholar 

  7. Corteel, S., Valencia-Pabon, M., Vera, J.C.: On approximating the b-chromatic number. Discret. Appl. Math. 146, 106–110 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  8. Effantin, B.: The b-chromatic number of power graphs of complete caterpillars. J. Discret. Math. Sci. Cryptogr. 8, 483–502 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  9. Effantin, B., Kheddouci, H.: The b-chromatic number of some power graphs. Discret. Math. Theor. Comput. Sci. 6, 45–54 (2003)

    MathSciNet  MATH  Google Scholar 

  10. Effantin, B., Kheddouci, H.: Exact values for the b-chromatic number of a power complete \(k\)-ary tree. J. Discret. Math. Sci. Cryptogr. 8, 117–129 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  11. Hammack, R., Imrich, W., Klavžar, S.: Handbook of Product Graphs, Discrete Mathematics and Its Applications, 2nd edn. CRC Press, Boca Raton (2011)

    Google Scholar 

  12. Hoang, C.T., Kouider, M.: On the \(b\)-dominating coloring of graphs. Discret. Appl. Math. 152, 176–186 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  13. Imrich, W., Klavz̆ar, S., Rall, D.F.: Topics in Graph Theory: Graphs and Their Cartesian Product. A.K. Peters, Wellesley (2008)

    Google Scholar 

  14. Iranmanesh, A., Gutman, I., Khormali, O., Mahmiani, A.: The edge version of the Wiener index. MATCH Commun. Math. Comuput. Chem. 61, 663–672 (2009)

    MathSciNet  MATH  Google Scholar 

  15. Irving, R.W., Manlove, D.F.: The b-chromatic number of a graph. Discret. Appl. Math. 91, 127–141 (1999)

    Article  MathSciNet  MATH  Google Scholar 

  16. Jakovac, M., Klavžar, S.: The b-chromatic number of cubic graphs. Graphs Combin. 26, 107–118 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  17. Jakovac, M., Peterin, I.: On the b-chromatic number of some products. Stud. Sci. Math. Hung. 49, 156–169 (2012)

    MathSciNet  MATH  Google Scholar 

  18. Kouider, M.: b-Chromatic Number of a Graph, Subgraphs and Degrees, Res. Rep. 1392. LRI, Orsay (2004)

    Google Scholar 

  19. Kouider, M., Mahéo, M.: Some bounds for the \(b\)-chromatic number of a graph. Discret. Math. 256, 267–277 (2002)

    Article  MATH  Google Scholar 

  20. Kouider, M., Mahéo, M.: The \(b\)-chromatic number of the Cartesian product of two graphs. Stud. Sci. Math. Hung. 44, 49–55 (2007)

    MATH  Google Scholar 

  21. Kouider, M., Zaker, M.: Bounds for the b-chromatic number of some families of graphs. Discret Math. 306, 617–623 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  22. Kratochvíl, J., Tuza, Z., Voigt, M.: On the b-chromatic number of graphs. Lect. Notes Comput. Sci. 2573, 310–320 (2002)

    Article  Google Scholar 

  23. Lima, C.V.G.C., Martins, N.A., Sampaio, L., Santos, M.C., Silva, A.: b-Chromatic Index of Graphs, Electron. Notes Discrete Math. 44, 9–14 (2013)

Download references

Acknowledgments

This work has been financed by ARRS Slovenia under the Grant P1-0297 and within the EUROCORES Programme EUROGIGA (Project GReGAS) of the European Science Foundation.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Marko Jakovac.

Additional information

Communicated by Xueliang Li.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Jakovac, M., Peterin, I. The b-Chromatic Index of a Graph. Bull. Malays. Math. Sci. Soc. 38, 1375–1392 (2015). https://doi.org/10.1007/s40840-014-0088-7

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s40840-014-0088-7

Keywords

Mathematics Subject Classification

Navigation