Radio k-colorings of paths

DOI10.7151/dmgt.1209zbMath1056.05053OpenAlexW2028341678MaRDI QIDQ4823290

Ladislav Nebeský, Ping Zhang, Gary Chartrand

Publication date: 27 October 2004

Published in: Discussiones Mathematicae Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.7151/dmgt.1209

zbMATH Keywords

pathradio \(k\)-coloring\(k\)-chromatic number

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Distance in graphs (05C12) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Related Items (13)

Radio and radial radio numbers of certain sunflower extended graphs ⋮ New results on radio \(k\)-labelings of distance graphs ⋮ A linear algorithm for radio \(k\)-coloring powers of paths having small diameter ⋮ Radio k-chromatic number of cycles for large k ⋮ Unnamed Item ⋮ Radio labelings of distance graphs ⋮ Distance measurements related to Cartesian product of cycles ⋮ A lower bound technique for radio \(k\)-coloring ⋮ Radio $k$-labeling of paths ⋮ Hamiltonian colorings of graphs ⋮ On Hamiltonian colorings of graphs ⋮ Multilevel Bandwidth and Radio Labelings of Graphs ⋮ Radio k-Labelings for Cartesian Products of Graphs

This page was built for publication: Radio k-colorings of paths