DP-colorings of uniform hypergraphs and splittings of Boolean hypercube into faces

DOI10.37236/10550zbMath1504.05095arXiv1905.04461OpenAlexW4288357638MaRDI QIDQ2170789

Vladimir N. Potapov

Publication date: 6 September 2022

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

hypercubehypergraphDP-coloring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (1)

Unnamed Item

Cites Work

• Correspondence coloring and its application to list-coloring planar graphs without cycles of lengths 4 to 8
• DP-degree colorable hypergraphs
• DP-colorings of hypergraphs
• The Erdős-Hajnal problem of hypergraph colouring, its generalizations, and related problems
• A note on random greedy coloring of uniform hypergraphs
• Improved bounds and algorithms for hypergraph 2-coloring

This page was built for publication: DP-colorings of uniform hypergraphs and splittings of Boolean hypercube into faces