Group colorings and DP-colorings of multigraphs using edge-disjoint decompositions
From MaRDI portal
Publication:2053689
DOI10.1007/S00373-021-02345-2zbMATH Open1479.05112OpenAlexW3167054464MaRDI QIDQ2053689FDOQ2053689
Authors: Hong-Jian Lai, L. Mazza 
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
Recommendations
- Group colorability of multigraphs
- On DP-coloring of graphs and multigraphs
- scientific article; zbMATH DE number 1472119
- scientific article; zbMATH DE number 4099331
- scientific article; zbMATH DE number 3958235
- Partitions and edge colourings of multigraphs
- Decompositions for edge-coloring join graphs and cobipartite graphs
- scientific article; zbMATH DE number 5263063
- DP-colorings of hypergraphs
- Group connectivity and group colorings of graphs --- a survey
correspondence coloringDP-coloringgroup chromatic numberedge-disjoint union of graphsgroup-coloringlist group coloring
Cites Work
- Graph theory
- Title not available (Why is that?)
- Group connectivity of graphs --- a nonhomogeneous analogue of nowhere-zero flow properties
- Group connectivity and group colorings of graphs --- a survey
- Group chromatic number of Halin graphs
- Group chromatic number of graphs without \(K_5\)-minors
- On group choosability of graphs. II
- Mathematical Foundations of Computer Science 2004
- Title not available (Why is that?)
- A note on group colorings
- Group colorability of multigraphs
- On group chromatic number of graphs
- On group choosability of total graphs
- On DP-coloring of graphs and multigraphs
- Correspondence coloring and its application to list-coloring planar graphs without cycles of lengths 4 to 8
- Colouring of generalized signed triangle-free planar graphs
- A ramsey-theoretic result involving chromatic numbers
- A note on a Brooks' type theorem for DP-coloring
- On group choosability of graphs. I.
Cited In (1)
This page was built for publication: Group colorings and DP-colorings of multigraphs using edge-disjoint decompositions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2053689)
