More results on the smallest one-realization of a given set. II

DOI10.7151/dmgt.2093zbMath1404.05052OpenAlexW2803574030MaRDI QIDQ1717199

Ping Zhao, Fuliang Lu, Kefeng Diao

Publication date: 7 February 2019

Published in: Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.7151/dmgt.2093

zbMATH Keywords

gapchromatic spectrummixed hypergraphfeasible setonerealization

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15)

Cites Work

• Unnamed Item
• Unnamed Item
• More result on the smallest one-realization of a given set
• Color-bounded hypergraphs. VI: Structural and functional jumps in complexity
• Non-monochromatic non-rainbow colourings of \(\sigma\)-hypergraphs
• 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. I: General results
• Mixed interval hypergraphs
• Colouring planar mixed hypergraphs
• The chromatic spectrum of mixed hypergraphs
• Coloring mixed hypergraphs: theory, algorithms and applications
• On feasible sets of mixed hypergraphs
• Constrained colouring and \(\sigma\)-hypergraphs
• \((2, 2)\)-colourings and clique-free \(\sigma\)-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
• C-perfect hypergraphs
• Mario Gionfriddo and mixed hypergraph coloring
• Gaps in the chromatic spectrum of face-constrained plane graphs

This page was built for publication: More results on the smallest one-realization of a given set. II