Group colorability of multigraphs

DOI10.1016/J.DISC.2012.09.009MaRDI QIDQ1759814zbMATH OpenOpenAlexFDO

Authors Hao Li, Hong-Jian Lai

Publication date 22 November 2012

Published in Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

Brook's theoremgroup coloringmultigraphupper bound

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Recommendations

• scientific article; zbMATH DE number 2188403
• A note on group colorings
• An inequality for the group chromatic number of a graph
• A note on a Brooks' type theorem for DP-coloring
• On group chromatic number of graphs

Cited in

(11)

• Group colorings and DP-colorings of multigraphs using edge-disjoint decompositions
• Graph polynomials and group coloring of graphs
• An inequality for the group chromatic number of a graph
• On group chromatic number of graphs
• A coloring property for countable groups
• A dual version of the brooks group coloring theorem
• Group chromatic number of Halin graphs
• A note on group colorings and group structure
• scientific article; zbMATH DE number 2188403 (Why is no real title available?)
• Polynomials counting group colorings in graphs
• Group coloring is \(\Pi_2^{\text{P}}\)-complete

This page was built for publication: Group colorability of multigraphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1759814)