The multichromatic numbers of some Kneser graphs
From MaRDI portal
Publication:1584256
DOI10.1016/S0012-365X(97)00211-2zbMath0956.05045MaRDI QIDQ1584256
Publication date: 2 November 2000
Published in: Discrete Mathematics (Search for Journal in Brave)
Related Items
\(k\)-tuple chromatic number of the Cartesian product of graphs ⋮ Set labelling vertices to ensure adjacency coincides with disjointness ⋮ Optimizing concurrency under Scheduling by Edge Reversal ⋮ Unnamed Item ⋮ Proof of Stahl's conjecture in some new cases ⋮ Lifted, projected and subgraph-induced inequalities for the representatives \(k\)-fold coloring polytope ⋮ \(k\)-tuple colorings of the Cartesian product of graphs ⋮ A new class of transitive graphs ⋮ On the topological lower bound for the multichromatic number ⋮ Unnamed Item ⋮ On the locating chromatic number of Kneser graphs ⋮ Covering arrays on graphs ⋮ On the Multichromatic Number of s‐Stable Kneser Graphs ⋮ On the Circular Chromatic Number of Graph Powers
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Kneser's conjecture, chromatic number, and homotopy
- Extremal problems concerning Kneser-graphs
- n-tuple colorings and associated graphs
- A short proof of Kneser's conjecture
- INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
- The Complexity of Near-Optimal Graph Coloring
- Two Results Concerning Multicoloring
- SOME INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
This page was built for publication: The multichromatic numbers of some Kneser graphs
