An inequality for the group chromatic number of a graph

DOI10.1016/j.disc.2007.03.014zbMath1127.05041OpenAlexW2007978256MaRDI QIDQ2462377

Hong-Jian Lai, Gexin Yu, Xiangwen Li

Publication date: 30 November 2007

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2007.03.014

zbMATH Keywords

Brooks' theoremgroup coloringgroup chromatic number

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (5)

Element deletion changes in dynamic coloring of graphs ⋮ Disproof of the group coloring version of the Hadwiger conjecture ⋮ Group edge choosability of planar graphs without adjacent short cycles ⋮ Group connectivity and group colorings of graphs --- a survey ⋮ Group chromatic number of Halin graphs

Cites Work

• Unnamed Item
• Group connectivity of graphs --- a nonhomogeneous analogue of nowhere-zero flow properties
• Bounds on eigenvalues and chromatic numbers
• The Eigenvalues of a Graph and Its Chromatic Number
• An inequality for the chromatic number of a graph

This page was built for publication: An inequality for the group chromatic number of a graph