A survey on radio \(k\)-colorings of graphs
From MaRDI portal
Publication:624122
zbMath1210.05150MaRDI QIDQ624122
Publication date: 8 February 2011
Published in: AKCE International Journal of Graphs and Combinatorics (Search for Journal in Brave)
frequency assignment problemradio \(k\)-chromatic numberradio \(k\)-coloringdistance constrained labelling
Coloring of graphs and hypergraphs (05C15) Distance in graphs (05C12) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)
Related Items (9)
Distance-constrained grid colouring ⋮ Radio numbers of some caterpillars ⋮ Hole: An Emerging Character in the Story of Radio k-Coloring Problem ⋮ An improved lower bound for the radio \(k\)-chromatic number of the hypercube qn ⋮ A linear algorithm for radio \(k\)-coloring powers of paths having small diameter ⋮ Radio labelings of distance graphs ⋮ A lower bound technique for radio \(k\)-coloring ⋮ Radio numbers of certain \(m\)-distant trees ⋮ Radio fuzzy graphs and assignment of frequency in radio stations
This page was built for publication: A survey on radio \(k\)-colorings of graphs
