scientific article; zbMATH DE number 2170463
From MaRDI portal
Publication:4677958
zbMath1064.05089MaRDI QIDQ4677958
Daphne Der-Fen Liu, Melanie Xie
Publication date: 23 May 2005
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
Radio mean labeling of a graph ⋮ On the radio number of square of graphs ⋮ Radio secure number of a graph ⋮ Hole: An Emerging Character in the Story of Radio k-Coloring Problem ⋮ Radio graceful Hamming graphs ⋮ Further results on the radio number of trees ⋮ An improved lower bound for the radio \(k\)-chromatic number of the hypercube qn ⋮ Antipodal number of some powers of cycles ⋮ Radio number for total graph of paths ⋮ Radio number of trees ⋮ A new graph radio k-coloring algorithm ⋮ Radio number of trees ⋮ Radio labelings of distance graphs ⋮ On characterizing radio \(k\)-coloring problem by path covering problem ⋮ A lower bound for radio \(k\)-chromatic number ⋮ Upper bound for radio -chromatic number of graphs in connection with partition of vertex set ⋮ Radio number for trees ⋮ Radio $k$-labeling of paths ⋮ Improved bounds for radio \(k\)-chromatic number of hypercube \(Q_{n}\) ⋮ Optimal radio labellings of complete \(m\)-ary trees ⋮ A new graph parameter and a construction of larger graph without increasing radio \(k\)-chromatic number ⋮ Radio \(k\)-chromatic number of full \(m\)-ary trees ⋮ Distance-constrained labeling of complete trees
