b-colouring the Cartesian product of trees and some other graphs

被引：7

作者：

Maffray, Frederic ^{[1
]}

Silva, Ana ^{[2
]}

机构：

[1] CNRS, Lab G SCOP, Grenoble, France

[2] Univ Grenoble 1, Lab G SCOP, Grenoble, France

来源：

DISCRETE APPLIED MATHEMATICS | 2013年 / 161卷 / 4-5期

关键词：

b-chromatic number; b-colouring; Cartesian product; Tree; Exact algorithm; CHROMATIC NUMBER;

D O I：

10.1016/j.dam.2011.06.019

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

A b-colouring of a graph is a colouring of its vertices such that every colour class contains a vertex that has a neighbour in all other classes. The b-chromatic number of a graph is the largest integer k such that the graph has a b-colouring with k colours. We show how to find in polynomial time an optimal b-colouring of the Cartesian product of trees by paths, cycles and stars. (C) 2011 Elsevier B.V. All rights reserved.

引用

页码：650 / 669

页数：20

共 50 条

[41] Parallel construction of optimal independent spanning trees on Cartesian product of complete graphs
Chen, Xie-Bin
[J]. INFORMATION PROCESSING LETTERS, 2011, 111 (05) : 235 - 238
[42] SHARP UPPER AND LOWER BOUNDS ON THE NUMBER OF SPANNING TREES IN CARTESIAN PRODUCT OF GRAPHS
Azarija, Jernej
[J]. DISCUSSIONES MATHEMATICAE GRAPH THEORY, 2013, 33 (04) : 785 - 790
[43] On subgraphs of Cartesian product graphs
Klavzar, S
Lipovec, A
Petkovsek, M
[J]. DISCRETE MATHEMATICS, 2002, 244 (1-3) : 223 - 230
[44] Panconnectivity of Cartesian product graphs
Lu, You
Xu, Jun-Ming
[J]. JOURNAL OF SUPERCOMPUTING, 2011, 56 (02): : 182 - 189
[45] Differential in Cartesian Product Graphs
Sigarreta, Jose M.
[J]. ARS COMBINATORIA, 2016, 126 : 259 - 267
[46] The profile of the Cartesian product of graphs
Kuo, David
Yan, Jing-Ho
[J]. DISCRETE APPLIED MATHEMATICS, 2008, 156 (15) : 2835 - 2845
[47] Connectivity of Cartesian product graphs
Xu, JM
Yang, C
[J]. DISCRETE MATHEMATICS, 2006, 306 (01) : 159 - 165
[48] On linkedness in the Cartesian product of graphs
Gábor Mészáros
[J]. Periodica Mathematica Hungarica, 2016, 72 : 130 - 138
[49] On linkedness in the Cartesian product of graphs
Meszaros, Gabor
[J]. PERIODICA MATHEMATICA HUNGARICA, 2016, 72 (02) : 130 - 138
[50] Panconnectivity of Cartesian product graphs
You Lu
Jun-Ming Xu
[J]. The Journal of Supercomputing, 2011, 56 : 182 - 189

← 1 2 3 4 5 →