THE GAME CHROMATIC NUMBER OF GENERALIZED WHEEL GRAPHS

2016 ◽  
Vol 100 (7) ◽  
pp. 1041-1054
Author(s):  
Siriwan Wasukree
2004 ◽  
Vol 281 (1-3) ◽  
pp. 209-219 ◽  
Author(s):  
Wenjie He ◽  
Jiaojiao Wu ◽  
Xuding Zhu

2019 ◽  
Vol 795 ◽  
pp. 50-56 ◽  
Author(s):  
Muhammad S. Akhtar ◽  
Usman Ali ◽  
Ghulam Abbas ◽  
Mutahira Batool

2008 ◽  
Vol 32 (2) ◽  
pp. 223-235 ◽  
Author(s):  
Tom Bohman ◽  
Alan Frieze ◽  
Benny Sudakov

2016 ◽  
Vol 100 (9) ◽  
pp. 1487-1503
Author(s):  
W. Charoenpanitseri ◽  
P. Chanthaweeroj

2019 ◽  
Vol 09 (04) ◽  
pp. 159-164 ◽  
Author(s):  
Ramy Shaheen ◽  
Ziad Kanaya ◽  
Khaled Alshehada

2015 ◽  
Vol 15 (01n02) ◽  
pp. 1550004 ◽  
Author(s):  
P. C. LISNA ◽  
M. S. SUNITHA

A b-coloring of a graph G is a proper coloring of the vertices of G such that there exists a vertex in each color class joined to at least one vertex in each other color classes. The b-chromatic number of a graph G, denoted by [Formula: see text], is the maximal integer k such that G has a b-coloring with k colors. In this paper, the b-chromatic numbers of the coronas of cycles, star graphs and wheel graphs with different numbers of vertices, respectively, are obtained. Also the bounds for the b-chromatic number of corona of any two graphs is discussed.


Sign in / Sign up

Export Citation Format

Share Document