scientific article
From MaRDI portal
Publication:3426085
zbMath1110.05033MaRDI QIDQ3426085
Riadh Khennoufa, Olivier Togni
Publication date: 8 March 2007
Full work available at URL: https://eudml.org/doc/32732
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Coloring of graphs and hypergraphs (05C15) Distance in graphs (05C12) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)
Related Items
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 ⋮ Antipodal number of some powers of cycles ⋮ A linear algorithm for radio \(k\)-coloring powers of paths having small diameter ⋮ Radio k-chromatic number of cycles for large k ⋮ Unnamed Item ⋮ Optimal radio-\(k\)-labelings of trees ⋮ On characterizing radio \(k\)-coloring problem by path covering problem ⋮ A lower bound for radio \(k\)-chromatic number ⋮ A lower bound technique for radio \(k\)-coloring ⋮ Radio $k$-labeling of paths ⋮ Improved bounds for radio \(k\)-chromatic number of hypercube \(Q_{n}\) ⋮ A new graph parameter and a construction of larger graph without increasing radio \(k\)-chromatic number ⋮ On Hamiltonian Colorings of Trees ⋮ Multilevel Bandwidth and Radio Labelings of Graphs ⋮ Antipodal radio labelling of full binary trees ⋮ On Hamiltonian Colorings of Block Graphs ⋮ On Hamiltonian colorings for some graphs ⋮ Radio \(k\)-chromatic number of full \(m\)-ary trees ⋮ Relationship between radio k-chromatic number of graphs and square graphs
