A linear algorithm for radio \(k\)-coloring powers of paths having small diameter

DOI10.1007/978-3-031-34347-6_13OpenAlexW4379117670MaRDI QIDQ6182900

Sagnik Sen, D. K. Supraja, Soumen Nandi, Dipayan Chakraborty

Publication date: 22 December 2023

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-031-34347-6_13

zbMATH Keywords

channel assignment problemradio \(k\)-chromatic numberradio coloringpower of paths

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Discrete mathematics in relation to computer science (68Rxx)

Cites Work

• A lower bound technique for radio \(k\)-coloring
• A survey on radio \(k\)-colorings of graphs
• A dynamic survey of graph labeling
• Nearly antipodal chromatic number $ac'(P_n)$ of the path $P_n$
• Labelling Graphs with a Condition at Distance 2
• Radio k-colorings of paths
• Linear and cyclic radio k-labelings of trees
• Multilevel Distance Labelings for Paths and Cycles
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A linear algorithm for radio \(k\)-coloring powers of paths having small diameter