Uniform mixed hypergraphs: the possible numbers of colors

DOI10.1007/s00373-007-0765-5zbMath1147.05025OpenAlexW2078747814WikidataQ59072724 ScholiaQ59072724MaRDI QIDQ2482347

Zsolt Tuza, Csilla Bujtás

Publication date: 16 April 2008

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

Full work available at URL: https://doi.org/10.1007/s00373-007-0765-5

zbMATH Keywords

vertex coloringmixed hypergraphfeasible set

Mathematics Subject Classification ID

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

Related Items (13)

Spectrum of mixed bi-uniform hypergraphs ⋮ On perfection and imperfection of one-realizations of a given set ⋮ More result on the smallest one-realization of a given set ⋮ On vertex independence number of uniform hypergraphs ⋮ The chromatic spectrum of 3-uniform bi-hypergraphs ⋮ On the structure of uniform one-realizations of a given set ⋮ The smallest one-realization of a given set. II. ⋮ 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 ⋮ ℱ-WORM colorings of some 2-trees: partition vectors ⋮ Color-bounded hypergraphs. I: General results ⋮ The minimum chromatic spectrum of 3-uniform \(\mathcal{C}\)-hypergraphs

Cites Work

• The chromatic spectrum of mixed hypergraphs
• Coloring mixed hypergraphs: theory, algorithms and applications
• On feasible sets of mixed hypergraphs
• Uncolorable mixed hypergraphs

This page was built for publication: Uniform mixed hypergraphs: the possible numbers of colors