On chromatic number of general Kneser graphs
From MaRDI portal
Publication:4598368
zbMATH Open1376.05045MaRDI QIDQ4598368FDOQ4598368
Authors: Sharareh Alipour, Amir Jafari
Publication date: 20 December 2017
Recommendations
Cited In (17)
- On the chromatic number of generalized Kneser hypergraphs
- On chromatic numbers of close-to-Kneser distance graphs
- Title not available (Why is that?)
- Chromatic numbers of Kneser-type graphs
- Chromatic number via Turán number
- Exact distance graphs of product graphs
- Title not available (Why is that?)
- On the chromatic number of a subgraph of the Kneser graph
- On the chromatic number of the general Kneser-graph
- On the chromatic number of generalized Kneser graphs and Hadamard matrices
- Almost envy-freeness in group resource allocation
- On the chromatic number of Kneser hypergraphs
- On the chromatic number of two generalized Kneser graphs
- The multichromatic numbers of some Kneser graphs
- On the chromatic number of some geometric type Kneser graphs
- Title not available (Why is that?)
- Total dominator chromatic number of Kneser graphs
This page was built for publication: On chromatic number of general Kneser graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4598368)