An inequality for the group chromatic number of a graph

被引：8

作者：

Lai, Hong-Jian ^{[2
]}

Li, Xiangwen ^{[1
]}

Yu, Gexin ^{[3
]}

机构：

[1] Huazhong Normal Univ, Dept Math, Wuhan 430079, Peoples R China

[2] W Virginia Univ, Dept Math, Morgantown, WV 26505 USA

[3] Univ Illinois, Dept Math, Urbana, IL 61801 USA

来源：

DISCRETE MATHEMATICS | 2007年 / 307卷 / 23期

关键词：

Brooks' theorem; group coloring; group chromatic number;

D O I：

10.1016/j.disc.2007.03.014

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

We give an inequality for the group chromatic number of a graph as an extension of Brooks' Theorem. Moreover, we obtain a structural theorem for graphs satisfying the equality and discuss applications of the theorem. (C) 2007 Elsevier B.V. All rights reserved.

引用

页码：3076 / 3080

页数：5

共 6 条

[1] On colouring the nodes of a network
Brooks, RL
[J]. PROCEEDINGS OF THE CAMBRIDGE PHILOSOPHICAL SOCIETY, 1941, 37 : 194 - 197
[2] Cao DS, 1998, LINEAR ALGEBRA APPL, V270, P1
[3] GROUP CONNECTIVITY OF GRAPHS - A NONHOMOGENEOUS ANALOG OF NOWHERE-ZERO FLOW PROPERTIES
JAEGER, F
LINIAL, N
PAYAN, C
TARSI, M
[J]. JOURNAL OF COMBINATORIAL THEORY SERIES B, 1992, 56 (02) : 165 - 182
[4] Lai HJ, 2002, ARS COMBINATORIA, V62, P299
[5] Szekeres G., 1968, J. Comb. Theory, V4, P1, DOI DOI 10.1016/S0021-9800(68)80081-X
[6] WILF HS, 1967, J LONDON MATH SOC, V42, P330

← 1 →