DP-degree colorable hypergraphs

DOI10.1016/j.tcs.2019.09.010zbMath1448.05077arXiv1808.01767OpenAlexW2973110611MaRDI QIDQ2333798

Thomas Schweser

Publication date: 13 November 2019

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1808.01767

zbMATH Keywords

Brooks' theoremhypergraph coloringlist-coloringcorrespondence coloringDP-coloring

Mathematics Subject Classification ID

Hypergraphs (05C65) Coloring of graphs and hypergraphs (05C15)

Related Items (4)

DP-colorings of uniform hypergraphs and splittings of Boolean hypercube into faces ⋮ Generalized DP-colorings of graphs ⋮ Variable degeneracy on toroidal graphs ⋮ Cover and variable degeneracy

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Correspondence coloring and its application to list-coloring planar graphs without cycles of lengths 4 to 8
• The colour theorems of Brooks and Gallai extended
• On DP-coloring of graphs and multigraphs
• DP-colorings of graphs with high chromatic number
• DP-colorings of hypergraphs
• A Survey on the Computational Complexity of Coloring Graphs with Forbidden Subgraphs
• Sharp Dirac's theorem for DP‐critical graphs
• A note on a Brooks' type theorem for DP‐coloring
• On chromatic number of graphs and set-systems

This page was built for publication: DP-degree colorable hypergraphs