Multichromatic numbers, star chromatic numbers and Kneser graphs
From MaRDI portal
Publication:4364807
DOI<link itemprop=identifier href="https://doi.org/10.1002/(SICI)1097-0118(199711)26:3<137::AID-JGT4>3.0.CO;2-S" /><137::AID-JGT4>3.0.CO;2-S 10.1002/(SICI)1097-0118(199711)26:3<137::AID-JGT4>3.0.CO;2-SzbMath0884.05041OpenAlexW2025314281MaRDI QIDQ4364807
No author found.
Publication date: 8 March 1998
Full work available at URL: https://doi.org/10.1002/(sici)1097-0118(199711)26:3<137::aid-jgt4>3.0.co;2-s
Related Items (19)
Strengthening topological colorful results for graphs ⋮ Circular colouring and algebraic no-homomorphism theorems ⋮ A combinatorial proof for the circular chromatic number of Kneser graphs ⋮ Circular chromatic number of Kneser graphs ⋮ A new coloring theorem of Kneser graphs ⋮ New results in \(t\)-tone coloring of graphs ⋮ Circular chromatic number of induced subgraphs of Kneser graphs ⋮ Multicoloring and Mycielski construction ⋮ On the chromatic number of general Kneser hypergraphs ⋮ Non-cover generalized Mycielski, Kneser, and Schrijver graphs ⋮ Channel assignment problem and \(n\)-fold \(t\)-separated \(L(j_1,j_2,\dots,j_m)\)-labeling of graphs ⋮ Circular coloring and Mycielski construction ⋮ Resource-sharing system scheduling and circular chromatic number ⋮ Multiple \(L(j,1)\)-labeling of the triangular lattice ⋮ On the chromatic number of a subgraph of the Kneser graph ⋮ On colorings of graph powers ⋮ On the fractional chromatic number and the lexicographic product of graphs ⋮ On the Multichromatic Number of s‐Stable Kneser Graphs ⋮ On the Circular Chromatic Number of Graph Powers
This page was built for publication: Multichromatic numbers, star chromatic numbers and Kneser graphs
