On the structure of uniform one-realizations of a given set

DOI10.1007/s00373-017-1866-4zbMath1390.05079OpenAlexW2778646436MaRDI QIDQ1706427

Kefeng Diao, Ping Zhao, Fuliang Lu, Vitaly I. Voloshin

Publication date: 22 March 2018

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-017-1866-4

zbMATH Keywords

chromatic spectrummixed hypergraphfeasible setone-realizationstrict coloring

Mathematics Subject Classification ID

Hypergraphs (05C65) Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On perfection and imperfection of one-realizations of a given set
• More result on the smallest one-realization of a given set
• Color-bounded hypergraphs. VI: Structural and functional jumps in complexity
• 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
• Color-bounded hypergraphs, IV: Stable colorings of hypertrees
• Color-bounded hypergraphs. I: General results
• Color-bounded hypergraphs. II: Interval hypergraphs and hypertrees
• Colouring planar mixed hypergraphs
• Uniquely colorable mixed hypergraphs
• The chromatic spectrum of mixed hypergraphs
• Coloring mixed hypergraphs: theory, algorithms and applications
• On feasible sets of mixed hypergraphs
• Pattern hypergraphs
• Uniform mixed hypergraphs: the possible numbers of colors
• A note on the least number of edges of 3-uniform hypergraphs with upper chromatic number 2
• The smallest one-realization of a given set. IV
• On the price of equivocation in byzantine agreement
• Color-bounded hypergraphs, V: host graphs and subdivisions

This page was built for publication: On the structure of uniform one-realizations of a given set