The b-Chromatic Number of Cubic Graphs

被引：0
|
作者：
Marko Jakovac
Sandi Klavžar
机构：
[1] University of Maribor,Faculty of Natural Sciences and Mathematics
[2] University of Ljubljana,Faculty of Mathematics and Physics
来源：
Graphs and Combinatorics | 2010年 / 26卷
关键词：
Chromatic number; b-Chromatic number; Cubic graph; Petersen graph; 05C15;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
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.
引用
收藏
页码：107 / 118
页数：11
相关论文
共 50 条
12345