About the upper chromatic number of a co-hypergraph

DOI10.1016/S0012-365X(99)00382-9zbMath0949.05031MaRDI QIDQ1567608

Kefeng Diao, Ping Zhao, Hui Shan Zhou

Publication date: 3 December 2000

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

zbMATH Keywords

colouringhypergraphschromatic numberscohypergraphs

Mathematics Subject Classification ID

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

Related Items (7)

The smallest uniform color-bounded hypergraphs which are one-realizations of a given set ⋮ Maximum number of colors: C-coloring and related problems ⋮ Smallest set-transversals of \(k\)-partitions ⋮ A note on the least number of edges of 3-uniform hypergraphs with upper chromatic number 2 ⋮ Coloring mixed hypertrees ⋮ The smallest one-realization of a given set. III ⋮ Pseudo-chordal mixed hypergraphs

This page was built for publication: About the upper chromatic number of a co-hypergraph