A note on the chromatic number of the square of Kneser graph K(2 k + 1, k)

DOI10.1016/J.DISC.2019.111630MaRDI QIDQ2279276zbMATH OpenOpenAlexFDO

Authors 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

zbMATH Keywords

chromatic numberKneser graphsquare of a graph

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Recommendations

• A new approach to the chromatic number of the square of Kneser graph \(K(2k+1,k)\)
• Improved bounds on the chromatic numbers of the square of Kneser graphs
• On the chromatic number of the square of the Kneser graph \(K(2k+1,k)\)
• Coloring of the square of Kneser graph \(K(2k+r,k)\)
• Coloring the square of the Kneser graph \(\mathrm{KG}(2k+1,k)\) and the Schrijver graph \(\mathrm{SG}(2k+2,k)\)

Cites work

• $L(2,1)$-Labeling of Hamiltonian graphs with Maximum Degree 3
• L(2,1)-labeling of Kneser graphs and coloring squares of Kneser graphs
• A bound on the chromatic number of the square of a planar graph
• A new approach to the chromatic number of the square of Kneser graph \(K(2k+1,k)\)
• A short proof of Kneser's conjecture
• A Theorem about the Channel Assignment Problem
• Coloring of the square of Kneser graph \(K(2k+r,k)\)
• Coloring the square of the Kneser graph \(\mathrm{KG}(2k+1,k)\) and the Schrijver graph \(\mathrm{SG}(2k+2,k)\)
• scientific article; zbMATH DE number 5717258 (Why is no real title available?)
• scientific article; zbMATH DE number 5763163 (Why is no real title available?)
• scientific article; zbMATH DE number 821271 (Why is no real title available?)
• Improved bounds on the chromatic numbers of the square of Kneser graphs
• Kneser's conjecture, chromatic number, and homotopy
• Labelling Graphs with a Condition at Distance 2
• On the chromatic number of the square of the Kneser graph \(K(2k+1,k)\)
• Optimal Real Number Graph Labellings of a Subfamily of Kneser Graphs
• The $L(2,1)$-Labeling Problem on Graphs
• The Chromatic Number of Graph Powers

Cited in

(6)

• Coloring the square of the Kneser graph \(\mathrm{KG}(2k+1,k)\) and the Schrijver graph \(\mathrm{SG}(2k+2,k)\)
• 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)\)
• Coloring of the square of Kneser graph \(K(2k+r,k)\)
• scientific article; zbMATH DE number 5717258 (Why is no real title available?)
• Improved bounds on the chromatic numbers of the square of Kneser graphs

This page was built for publication: A note on the chromatic number of the square of Kneser graph \(K(2 k + 1, k)\)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2279276)