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, K3,3, the prism over K3, and one more sporadic example on 10 vertices.
机构:
Univ Maribor, Fac Nat Sci & Math, SLO-2000 Maribor, SloveniaUniv Maribor, Fac Nat Sci & Math, SLO-2000 Maribor, Slovenia
Jakovac, Marko
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
机构:
Univ Ljubljana, Fac Math & Phys, Ljubljana 1000, Slovenia
Inst Math Phys & Mech, Ljubljana 1000, SloveniaUniv Maribor, Fac Nat Sci & Math, SLO-2000 Maribor, Slovenia
Cabello, Sergio
Jakovac, Marko
论文数: 0引用数: 0
h-index: 0
机构:
Univ Maribor, Fac Nat Sci & Math, SLO-2000 Maribor, SloveniaUniv Maribor, Fac Nat Sci & Math, SLO-2000 Maribor, Slovenia
机构:
DePaul Univ, Dept Math Sci, 2320 N Kenmore Ave, Chicago, IL 60614 USADePaul Univ, Dept Math Sci, 2320 N Kenmore Ave, Chicago, IL 60614 USA
Bockting-Conrad, Sarah
Jakovac, Marko
论文数: 0引用数: 0
h-index: 0
机构:
Univ Maribor, Fac Nat Sci & Math, Koroska Cesta 160, Maribor 2000, Slovenia
Inst Math Phys & Mech, Jadranska 19, Ljubljana 1000, SloveniaDePaul Univ, Dept Math Sci, 2320 N Kenmore Ave, Chicago, IL 60614 USA
Jakovac, Marko
Lang, Michael S.
论文数: 0引用数: 0
h-index: 0
机构:
Bradley Univ, Math Dept, 1501 W Bradley Ave, Peoria, IL 61625 USADePaul Univ, Dept Math Sci, 2320 N Kenmore Ave, Chicago, IL 60614 USA