On group chromatic number of graphs

DOI10.1007/s00373-005-0625-0zbMath1092.05024OpenAlexW2056860914MaRDI QIDQ2494108

Xiangwen Li, Hong-Jian Lai

Publication date: 16 June 2006

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-005-0625-0

zbMATH Keywords

colorabilityorientationabelian group

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Coloring of graphs and hypergraphs (05C15)

Related Items (6)

Group connectivity and group colorings of graphs --- a survey ⋮ A note on group choosability of graphs with girth at least 4 ⋮ Group chromatic number of Halin graphs ⋮ On group choosability of graphs. II ⋮ HAJÓS-LIKE THEOREM FOR GROUP COLORING ⋮ Group colorings and DP-colorings of multigraphs using edge-disjoint decompositions

Cites Work

• Group connectivity of graphs --- a nonhomogeneous analogue of nowhere-zero flow properties
• Group chromatic number of graphs without \(K_5\)-minors
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On group chromatic number of graphs