Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

38

GC
2010
Springer

favoriteEmaildiscussreport

190views Applied Computing» more GC 2010»

The b-Chromatic Number of Cubic Graphs

13 years 9 months ago

The b-Chromatic Number of Cubic Graphs

Download www-mat.pfmb.uni-mb.si

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. Key words: chromatic number; b-chromatic number; cubic graph; Petersen graph. AMS subject classiﬁcation (2000): 05C15

Marko Jakovac, Sandi Klavzar

Real-time Traffic

Applied Computing | B-chromatic Number | Cubic Graph | GC 2010 | Petersen Graph |

claim paper

Related Content

» Crossing Number Is Hard for Cubic Graphs

» An improved linear bound on the number of perfect matchings in cubic graphs

» A 53Approximation for Finding Spanning Trees with Many Leaves in Cubic Graphs

» The independence number in graphs of maximum degree three

» Crossing Numbers of Graphs with Rotation Systems

» Domination in Graphs of Minimum Degree at least Two and Large Girth

» Crossing Number of Graphs with Rotation Systems

» Analysis of a Simple Greedy Matching Algorithm on Random Cubic Graphs

» Adding one edge to planar graphs makes crossing number hard

Post Info
More Details (n/a)

Added	25 Jan 2011
Updated	25 Jan 2011
Type	Journal
Year	2010
Where	GC
Authors	Marko Jakovac, Sandi Klavzar

Comments (0)