Contents

Ars Combinatoria

  • Research article

On Group Choosability of Graphs

H. Chuang1, H.-J. Lai2, G.R. Omidi1,3, N. Zakeri1
1Department of Mathematical Sciences, Isfahan University of Technology, Isfahan, 84156-83111, Iran
2College of Mathematics and System Sciences, Xinjiang University, Urumqi, Xinjiang 830046, PRC and Department of Mathematics, West Virginia University, Morgantown, WV 26505, USA
3School of Mathematics, Institute for Research in Fundamental Sciences (IPM), P.O.Box:19395-5746, Tehran, Iran
  • Published: 30/04/2016

Abstract

We investigate the group choice number of a graph \(G\) and prove the group list coloring version of Brooks’ Theorem, the group list coloring version of Szekeres-Wilf extension of Brooks’ Theorem, and the Nordhaus-Gaddum inequalities for group choice numbers. Furthermore, we characterize all \(D\)-group choosable graphs and all \(3\)-group choosable complete bipartite graphs.

Information
Guidelines
CP Initiatives
Follow CP
Facebook X-twitter Linkedin

1970-2025 CP (Manitoba, Canada) unless otherwise stated.

Citation
H. Chuang, H.-J. Lai, G.R. Omidi, N. Zakeri. On Group Choosability of Graphs[J], Ars Combinatoria, Volume 126. 195-209. .