Multiple Coloring of Cone Graphs

DOI10.1137/070691486zbMath1222.05072OpenAlexW2027828847MaRDI QIDQ3013144

Zhishi Pan, Xuding Zhu

Publication date: 18 July 2011

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

Full work available at URL: https://doi.org/10.1137/070691486

zbMATH Keywords

fractional chromatic numberKneser graphsMycielski graphscone graphsmultiple coloring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (4)

Channel assignment problem and \(n\)-fold \(t\)-separated \(L(j_1,j_2,\dots,j_m)\)-labeling of graphs ⋮ Distinguishing Generalized Mycielskian Graphs ⋮ Symmetry parameters for Mycielskian graphs ⋮ On the Multichromatic Number of s‐Stable Kneser Graphs

This page was built for publication: Multiple Coloring of Cone Graphs