Group colorings and DP-colorings of multigraphs using edge-disjoint decompositions
From MaRDI portal
Publication:2053689
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
Cites work
- scientific article; zbMATH DE number 3458752 (Why is no real title available?)
- scientific article; zbMATH DE number 2188403 (Why is no real title available?)
- A note on a Brooks' type theorem for DP-coloring
- A note on group colorings
- A ramsey-theoretic result involving chromatic numbers
- Colouring of generalized signed triangle-free planar graphs
- Correspondence coloring and its application to list-coloring planar graphs without cycles of lengths 4 to 8
- Graph theory
- Group chromatic number of Halin graphs
- Group chromatic number of graphs without \(K_5\)-minors
- Group colorability of multigraphs
- Group connectivity and group colorings of graphs --- a survey
- Group connectivity of graphs --- a nonhomogeneous analogue of nowhere-zero flow properties
- Mathematical Foundations of Computer Science 2004
- On DP-coloring of graphs and multigraphs
- On group choosability of graphs. I.
- On group choosability of graphs. II
- On group choosability of total graphs
- On group chromatic number of graphs
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)
