Group colorings and DP-colorings of multigraphs using edge-disjoint decompositions

DOI10.1007/s00373-021-02345-2zbMath1479.05112OpenAlexW3167054464MaRDI QIDQ2053689

L. Mazza, Hong-Jian Lai

Publication date: 30 November 2021

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

Full work available at URL: https://doi.org/10.1007/s00373-021-02345-2

zbMATH Keywords

correspondence coloringDP-coloringgroup chromatic numberedge-disjoint union of graphsgroup-coloringlist group coloring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Group chromatic number of Halin graphs
• Correspondence coloring and its application to list-coloring planar graphs without cycles of lengths 4 to 8
• Group connectivity of graphs --- a nonhomogeneous analogue of nowhere-zero flow properties
• Group chromatic number of graphs without \(K_5\)-minors
• Colouring of generalized signed triangle-free planar graphs
• Group colorability of multigraphs
• On group choosability of graphs. II
• On DP-coloring of graphs and multigraphs
• On group choosability of total graphs
• Group connectivity and group colorings of graphs --- a survey
• On group chromatic number of graphs
• A ramsey-theoretic result involving chromatic numbers
• Mathematical Foundations of Computer Science 2004
• A note on a Brooks' type theorem for DP‐coloring
• A note on group colorings

This page was built for publication: Group colorings and DP-colorings of multigraphs using edge-disjoint decompositions