scientific article; zbMATH DE number 6107247
From MaRDI portal
Publication:4650002
zbMath1265.05536MaRDI QIDQ4650002
Riadh Khennoufa, Olivier Togni
Publication date: 15 November 2012
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
Radio-\(k\)-labeling of cycles for large \(k\) ⋮ Radio mean labeling of a graph ⋮ On the radio number of square of graphs ⋮ Hole: An Emerging Character in the Story of Radio k-Coloring Problem ⋮ Radio number for the Cartesian product of two trees ⋮ A new graph radio k-coloring algorithm ⋮ Improved lower bounds for the radio number of trees ⋮ Optimal radio-\(k\)-labelings of trees ⋮ On characterizing radio \(k\)-coloring problem by path covering problem ⋮ A lower bound for radio \(k\)-chromatic number ⋮ Optimal radio labellings of block graphs and line graphs of trees ⋮ Antipodal number of full \(m\)-ary trees ⋮ Upper bound for radio -chromatic number of graphs in connection with partition of vertex set ⋮ Radio $k$-labeling of paths ⋮ Computing edge weights of magic labeling on rooted products of graphs ⋮ Improved bounds for radio \(k\)-chromatic number of hypercube \(Q_{n}\) ⋮ Optimal radio labellings of complete \(m\)-ary trees ⋮ Multilevel Bandwidth and Radio Labelings of Graphs ⋮ Antipodal radio labelling of full binary trees ⋮ Radio \(k\)-chromatic number of full \(m\)-ary trees ⋮ ℓ-distant Hamiltonian walks in Cartesian product graphs ⋮ Distance-constrained labeling of complete trees ⋮ Relationship between radio k-chromatic number of graphs and square graphs
This page was built for publication:
