The smallest one-realization of a given set. IV

DOI10.1016/j.disc.2014.12.021zbMath1306.05057arXiv1306.0634OpenAlexW1983918263MaRDI QIDQ2514158

Kaishun Wang, Ping Zhao, Kefeng Diao, Vitaly I. Voloshin

Publication date: 30 January 2015

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

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

zbMATH Keywords

chromatic spectrummixed hypergraphfeasible setone-realizationhypergraph coloring\(r\)-uniform bi-hypergraph

Mathematics Subject Classification ID

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

Related Items (5)

On perfection and imperfection of one-realizations of a given set ⋮ More result on the smallest one-realization of a given set ⋮ The smallest uniform color-bounded hypergraphs which are one-realizations of a given set ⋮ On the structure of uniform one-realizations of a given set ⋮ More results on the smallest one-realization of a given set. II

Cites Work

• Unnamed Item
• Unnamed Item
• The chromatic spectrum of 3-uniform bi-hypergraphs
• The smallest one-realization of a given set
• The smallest one-realization of a given set. II.
• The smallest one-realization of a given set. III
• Mixed hypergraphs and other coloring problems
• Colouring planar mixed hypergraphs
• The chromatic spectrum of mixed hypergraphs
• Coloring mixed hypergraphs: theory, algorithms and applications
• On feasible sets of mixed hypergraphs
• Uniform mixed hypergraphs: the possible numbers of colors
• On the price of equivocation in byzantine agreement

This page was built for publication: The smallest one-realization of a given set. IV