HAJÓS-LIKE THEOREM FOR GROUP COLORING

DOI10.1142/S1793830910000772zbMath1201.05032OpenAlexW2058283636MaRDI QIDQ3063613

Xinhui An, Baoyindureng Wu

Publication date: 15 December 2010

Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s1793830910000772

zbMATH Keywords

list coloringgroup coloring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (1)

Hajós-like theorem for signed graphs

Cites Work

• Unnamed Item
• Group connectivity of graphs --- a nonhomogeneous analogue of nowhere-zero flow properties
• Group chromatic number of graphs without \(K_5\)-minors
• Hajós' theorem for list coloring
• A Hajós-like theorem for list coloring
• On group chromatic number of graphs

This page was built for publication: HAJÓS-LIKE THEOREM FOR GROUP COLORING