About the upper chromatic number of a co-hypergraph
From MaRDI portal
Publication:1567608
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)
Related Items
Maximum number of colors: C-coloring and related problems, The smallest one-realization of a given set. III, Smallest set-transversals of \(k\)-partitions, Pseudo-chordal mixed hypergraphs, The smallest uniform color-bounded hypergraphs which are one-realizations of a given set, A note on the least number of edges of 3-uniform hypergraphs with upper chromatic number 2, Coloring mixed hypertrees