Multiple coloring of cone graphs

DOI10.1137/070691486MaRDI QIDQ3013144zbMATH OpenOpenAlexFDO

Authors 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

cone graphsfractional chromatic numberKneser graphsmultiple coloringMycielski graphs

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Recommendations

• Multi-coloring the Mycielskian of graphs
• The fractional chromatic number of generalized cones over graphs
• Multicoloring and Mycielski construction
• On optimal \(k\)-fold colorings of webs and antiwebs
• Fractional chromatic numbers of cones over graphs

Cited in

(7)

• Channel assignment problem and n-fold t-separated L(j₁,j₂,,j_m)-labeling of graphs
• Symmetry parameters for Mycielskian graphs
• The fractional chromatic number of generalized cones over graphs
• Multi-coloring the Mycielskian of graphs
• Distinguishing generalized Mycielskian graphs
• On the multichromatic number of \(s\)-stable Kneser graphs
• Determining number and cost of generalized Mycielskian graphs

This page was built for publication: Multiple coloring of cone graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3013144)