Multi-coloring the Mycielskian of graphs
From MaRDI portal
Publication:3553236
Recommendations
Cites work
- Circular chromatic number: A survey
- Discrete mathematics: topics in combinatorics
- Fractional chromatic numbers of cones over graphs
- scientific article; zbMATH DE number 3672329 (Why is no real title available?)
- 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)- Packing chromatic number versus chromatic and clique number
- Channel assignment problem and n-fold t-separated L(j₁,j₂,,j_m)-labeling of graphs
- On optimal \(k\)-fold colorings of webs and antiwebs
- Multiple L(j,1)-labeling of the triangular lattice
- On the multiple Borsuk numbers of sets
- Incidence coloring of mycielskians with fast algorithm
- Independence number and packing coloring of generalized Mycielski graphs
- Multiple coloring of cone graphs
- On multiset colorings of graphs
- scientific article; zbMATH DE number 5952684 (Why is no real title available?)
- On the Generalized $\vartheta$-Number and Related Problems for Highly Symmetric Graphs
- On the multichromatic number of \(s\)-stable Kneser graphs
- scientific article; zbMATH DE number 5038437 (Why is no real title available?)
- The exponential growth of the packing chromatic number of iterated Mycielskians
- \(k\)-fold coloring of planar graphs
- Multicoloring and Mycielski construction
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)