A note on the chromatic number of the square of Kneser graph \(K(2 k + 1, k)\)
From MaRDI portal
Publication:2279276
DOI10.1016/j.disc.2019.111630zbMath1429.05071OpenAlexW2967020465MaRDI QIDQ2279276
Jeong-Hyun Kang, Hemanshu Kaul
Publication date: 12 December 2019
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2019.111630
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Improved bounds on the chromatic numbers of the square of Kneser graphs
- \(L(2,1)\)-labeling of Kneser graphs and coloring squares of Kneser graphs
- Kneser's conjecture, chromatic number, and homotopy
- Coloring the square of the Kneser graph \(\mathrm{KG}(2k+1,k)\) and the Schrijver graph \(\mathrm{SG}(2k+2,k)\)
- A short proof of Kneser's conjecture
- On the chromatic number of the square of the Kneser graph \(K(2k+1,k)\)
- A new approach to the chromatic number of the square of Kneser graph \(K(2k+1,k)\)
- A bound on the chromatic number of the square of a planar graph
- Coloring of the square of Kneser graph \(K(2k+r,k)\)
- Optimal Real Number Graph Labellings of a Subfamily of Kneser Graphs
- $L(2,1)$-Labeling of Hamiltonian graphs with Maximum Degree 3
- Labelling Graphs with a Condition at Distance 2
- The Chromatic Number of Graph Powers
- A Theorem about the Channel Assignment Problem
- The $L(2,1)$-Labeling Problem on Graphs
This page was built for publication: A note on the chromatic number of the square of Kneser graph \(K(2 k + 1, k)\)
