Multi-coloring the Mycielskian of graphs

DOI10.1002/jgt.20429zbMath1211.05044OpenAlexW4244881898MaRDI QIDQ3553236

Xuding Zhu, Daphne Der-Fen Liu, Wensong Lin

Publication date: 22 April 2010

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.20429

zbMATH Keywords

Kneser graphMycielskianmulti-coloring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (8)

Packing chromatic number versus chromatic and clique number ⋮ Independence number and packing coloring of generalized Mycielski graphs ⋮ On the Generalized $\vartheta$-Number and Related Problems for Highly Symmetric Graphs ⋮ The exponential growth of the packing chromatic number of iterated Mycielskians ⋮ Channel assignment problem and \(n\)-fold \(t\)-separated \(L(j_1,j_2,\dots,j_m)\)-labeling of graphs ⋮ Multiple \(L(j,1)\)-labeling of the triangular lattice ⋮ On the multiple Borsuk numbers of sets ⋮ On the Multichromatic Number of s‐Stable Kneser Graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Kneser's conjecture, chromatic number, and homotopy
• Star-extremal graphs and the lexicographic product
• Fractional chromatic numbers of cones over graphs
• SOME INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• Circular chromatic number: A survey

This page was built for publication: Multi-coloring the Mycielskian of graphs