Multi-coloring the Mycielskian of graphs
From MaRDI portal
Publication:3553236
DOI10.1002/JGT.20429zbMATH Open1211.05044OpenAlexW4244881898MaRDI QIDQ3553236FDOQ3553236
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
Recommendations
Cites Work
- Kneser's conjecture, chromatic number, and homotopy
- Title not available (Why is that?)
- SOME INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
- Circular chromatic number: A survey
- Fractional chromatic numbers of cones over graphs
- Star-extremal graphs and the lexicographic product
- Discrete mathematics: topics in combinatorics
Cited In (16)
- Title not available (Why is that?)
- On the multichromatic number of \(s\)-stable Kneser graphs
- On multiset colorings of graphs
- On the multiple Borsuk numbers of sets
- Title not available (Why is that?)
- On optimal \(k\)-fold colorings of webs and antiwebs
- Multiple coloring of cone graphs
- Channel assignment problem and \(n\)-fold \(t\)-separated \(L(j_1,j_2,\dots,j_m)\)-labeling of graphs
- On the Generalized $\vartheta$-Number and Related Problems for Highly Symmetric Graphs
- Packing chromatic number versus chromatic and clique number
- 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)
