Multicoloring and Mycielski construction
From MaRDI portal
Publication:932681
DOI10.1016/j.disc.2007.07.015zbMath1162.05022OpenAlexW2015307128MaRDI QIDQ932681
Publication date: 11 July 2008
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2007.07.015
fractional chromatic numberhomomorphismKneser graphMycielskian\(a/b\)-coloring\(k\)-tuple coloring\(p\)-Mycielskian
Related Items (7)
On the Generalized $\vartheta$-Number and Related Problems for Highly Symmetric Graphs ⋮ \(k\)-fold coloring of planar graphs ⋮ Tight Lower Bounds for the Complexity of Multicoloring ⋮ 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 ⋮ k-FOLD (2k + 1)-COLORING OF PLANAR GRAPHS ⋮ On the Multichromatic Number of s‐Stable Kneser Graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- n-tuple colorings and associated graphs
- Circular chromatic numbers of Mycielski's graphs
- Hamiltonicity, diameter, domination, packing, and biclique partitions of Mycielski's graphs
- Circular chromatic number and a generalization of the construction of Mycielski.
- On the fractional chromatic number and the lexicographic product of graphs
- Circular chromatic number for iterated Mycielski graphs
- Star-extremal graphs and the lexicographic product
- Several parameters of generalized Mycielskians
- Fractional chromatic numbers of cones over graphs
- Two Results Concerning Multicoloring
- The circular chromatic number of the Mycielskian ofGdk
- Multichromatic numbers, star chromatic numbers and Kneser graphs
- Circular chromatic number of subgraphs
- The fractional chromatic number of mycielski's graphs
- Fractional colorings with large denominators
- Sur le coloriage des graphs
- Circular chromatic number and Mycielski graphs
- A lower bound on the chromatic number of Mycielski graphs
This page was built for publication: Multicoloring and Mycielski construction
