Optimal Real Number Graph Labellings of a Subfamily of Kneser Graphs

DOI10.1137/060672923zbMath1207.05051DBLPjournals/siamdm/ErmanJKSS09OpenAlexW2037230105WikidataQ57601470 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

zbMATH Keywords

channel assignment problemKneser graphsgraph labelling with distance conditionsreal number graph labelling

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Related Items (5)

A new approach to the chromatic number of the square of Kneser graph \(K(2k+1,k)\) ⋮ Graph labellings with variable weights, a survey ⋮ On real number labelings and graph invertibility ⋮ A note on the chromatic number of the square of Kneser graph \(K(2 k + 1, k)\) ⋮ THE λ-NUMBER OF THE CARTESIAN PRODUCT OF A COMPLETE GRAPH AND A CYCLE

This page was built for publication: Optimal Real Number Graph Labellings of a Subfamily of Kneser Graphs