机构:
Univ Maribor, Fac Nat Sci & Math, SLO-2000 Maribor, SloveniaUniv Maribor, Fac Nat Sci & Math, SLO-2000 Maribor, Slovenia
Jakovac, Marko
[1
]
Klavzar, Sandi
论文数: 0引用数: 0
h-index: 0
机构:
Univ Maribor, Fac Nat Sci & Math, SLO-2000 Maribor, Slovenia
Univ Ljubljana, Fac Math & Phys, Ljubljana 1000, SloveniaUniv Maribor, Fac Nat Sci & Math, SLO-2000 Maribor, Slovenia
The b-chromatic number of a graph G is the largest integer k such that G admits a proper k-coloring in which every color class contains at least one vertex adjacent to some vertex in all the other color classes. It is proved that with four exceptions, the b-chromatic number of cubic graphs is 4. The exceptions are the Petersen graph, K (3,3), the prism over K (3), and one more sporadic example on 10 vertices.