scientific article

zbMath1278.05107MaRDI QIDQ2869309

Pratima Panigrahi, Laxman Saha

Publication date: 3 January 2014

Full work available at URL: http://ajc.maths.uq.edu.au/pdf/55/ajc_v55_p273.pdf

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (19)

Radio-\(k\)-labeling of cycles for large \(k\) ⋮ On the radio number of square of graphs ⋮ Hole: An Emerging Character in the Story of Radio k-Coloring Problem ⋮ Radio graceful Hamming graphs ⋮ 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 ⋮ 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 ⋮ On the radio number for corona of paths and cycles ⋮ Upper bound for radio -chromatic number of graphs in connection with partition of vertex set ⋮ Radio $k$-labeling of paths ⋮ A new graph parameter and a construction of larger graph without increasing radio \(k\)-chromatic number ⋮ Antipodal radio labelling of full binary trees ⋮ Radio \(k\)-chromatic number of full \(m\)-ary trees ⋮ Radio fuzzy graphs and assignment of frequency in radio stations ⋮ Relationship between radio k-chromatic number of graphs and square graphs

This page was built for publication: