Polychromatic colorings of hypergraphs with high balance

DOI10.3934/math.2020195zbMath1484.05070OpenAlexW3012034316MaRDI QIDQ2129929

Xia Zhang, Jun Yue, Zhenzhen Jiang

Publication date: 25 April 2022

Published in: AIMS Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3934/math.2020195

zbMATH Keywords

hypergraphprobabilistic methodcover decompositionpolychromatic coloringbalanced coloring

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Some class 1 graphs on \(g_c\)-colorings
• Coloring and the Lovász local lemma
• Edge covered critical multigraphs
• A note on the edge cover chromatic index of multigraphs
• ``Integer-making theorems
• The Grötzsch theorem for the hypergraph of maximal cliques
• A sufficient condition for equitable edge-colourings of simple graphs
• Worst-case-optimal algorithms for guarding planar graphs and polyhedral surfaces
• Disconnected \(g_c\)-critical graphs
• On 2-coloring certain \(k\)-uniform hypergraphs
• Polychromatic colorings and cover decompositions of hypergraphs
• 2-colorings in \(k\)-regular \(k\)-uniform hypergraphs
• Equitable edge-colorings of simple graphs
• Cover-Decomposition and Polychromatic Numbers
• On decompositions of a multi-graph into spanning subgraphs
• Colouring the Edges of a Multigraph so that Each Vertex has at Most j , or at Least j , Edges of Each Colour on it
• On $g_c$-colorings of nearly bipartite graphs
• Polychromatic colorings of complete graphs with respect to 1‐, 2‐factors and Hamiltonian cycles
• Polychromatic colorings of plane graphs

This page was built for publication: Polychromatic colorings of hypergraphs with high balance