Linear and cyclic radio k-labelings of trees
From MaRDI portal
Publication:5444060
DOI10.7151/dmgt.1348zbMath1137.05063MaRDI QIDQ5444060
Mustapha Kchikech, Riadh Khennoufa, Olivier Togni
Publication date: 22 February 2008
Published in: Discussiones Mathematicae Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.7151/dmgt.1348
Related Items
Radio $k$-labeling of paths, Radio k-chromatic number of cycles for large k, Multilevel Bandwidth and Radio Labelings of Graphs, Unnamed Item, On radio \(k\)-labeling of the power of the infinite path, A linear algorithm for radio \(k\)-coloring powers of paths having small diameter, Radio mean labeling of a graph, Radio numbers of some caterpillars, A lower bound technique for radio \(k\)-coloring, An improved lower bound for the radio \(k\)-chromatic number of the hypercube qn, Radio numbers of certain \(m\)-distant trees, New results on radio \(k\)-labelings of distance graphs, Radio labelings of distance graphs, On the radio \(k\)-chromatic number of some classes of trees, ON RADIO NUMBER OF POWER OF CYCLES