The smallest one-realization of a given set. II.

DOI10.1016/J.DISC.2012.06.004zbMath1248.05072OpenAlexW4206587284MaRDI QIDQ449141

Renying Chang, Ping Zhao, Kaishun Wang, Kefeng Diao

Publication date: 12 September 2012

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

Full work available at URL: https://doi.org/10.1016/j.disc.2012.06.004

zbMATH Keywords

chromatic spectrummixed hypergraphfeasible setone-realization

Mathematics Subject Classification ID

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

Related Items (8)

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 ⋮ The smallest one-realization of a given set. IV ⋮ The smallest one-realization of a given set. III ⋮ The minimum chromatic spectrum of 3-uniform \(\mathcal{C}\)-hypergraphs

Cites Work

• The chromatic spectrum of 3-uniform bi-hypergraphs
• The smallest one-realization of a given set
• 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
• Unnamed Item
• Unnamed Item
• Unnamed Item

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