Optimal Real Number Graph Labellings of a Subfamily of Kneser Graphs
From MaRDI portal
Publication:3583310
DOI10.1137/060672923zbMath1207.05051WikidataQ57601470 ScholiaQ57601470MaRDI QIDQ3583310
Rok Erman, Nik Stopar, Kris Stopar, Suzana Jurečič, Daniel Král'
Publication date: 27 August 2010
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/57ba8bfad6b13f3638f395cc36368ddd5477320d
channel assignment problem; Kneser graphs; graph labelling with distance conditions; real number graph labelling
Related Items
THE λ-NUMBER OF THE CARTESIAN PRODUCT OF A COMPLETE GRAPH AND A CYCLE, On real number labelings and graph invertibility, Graph labellings with variable weights, a survey, A note on the chromatic number of the square of Kneser graph \(K(2 k + 1, k)\), A new approach to the chromatic number of the square of Kneser graph \(K(2k+1,k)\)