Multi-coloring the Mycielskian of graphs

DOI10.1002/JGT.20429MaRDI QIDQ3553236zbMATH OpenOpenAlexFDO

Authors Wensong Lin, Daphne Der-Fen Liu, Xuding Zhu

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)

Recommendations

• Multicoloring and Mycielski construction
• Multiple coloring of cone graphs
• \(k\)-fold \((2k+1)\)-coloring of planar graphs
• On optimal \(k\)-fold colorings of webs and antiwebs
• \(k\)-fold coloring of planar graphs

Cites work

• scientific article; zbMATH DE number 3672329 (Why is no real title available?)
• Circular chromatic number: A survey
• Discrete mathematics: topics in combinatorics
• Fractional chromatic numbers of cones over graphs
• Kneser's conjecture, chromatic number, and homotopy
• SOME INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• Star-extremal graphs and the lexicographic product

Cited in

(16)

• scientific article; zbMATH DE number 5952684 (Why is no real title available?)
• On the multichromatic number of \(s\)-stable Kneser graphs
• On multiset colorings of graphs
• On the multiple Borsuk numbers of sets
• On optimal \(k\)-fold colorings of webs and antiwebs
• Channel assignment problem and \(n\)-fold \(t\)-separated \(L(j_1,j_2,\dots,j_m)\)-labeling of graphs
• scientific article; zbMATH DE number 5038437 (Why is no real title available?)
• Multiple coloring of cone graphs
• Packing chromatic number versus chromatic and clique number
• On the Generalized $\vartheta$-Number and Related Problems for Highly Symmetric Graphs
• The exponential growth of the packing chromatic number of iterated Mycielskians
• Independence number and packing coloring of generalized Mycielski graphs
• Incidence coloring of mycielskians with fast algorithm
• \(k\)-fold coloring of planar graphs
• Multicoloring and Mycielski construction
• Multiple \(L(j,1)\)-labeling of the triangular lattice

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

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