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

DOI10.1007/978-3-031-34347-6_13MaRDI QIDQ6182900zbMATH OpenOpenAlexFDO

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

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 problempower of pathsradio \(k\)-chromatic numberradio coloring

Mathematics Subject Classification ID

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

Cites work

• A dynamic survey of graph labeling
• A lower bound technique for radio k-coloring
• A note on radio antipodal colourings of paths.
• A survey on radio \(k\)-colorings of graphs
• scientific article; zbMATH DE number 5850548 (Why is no real title available?)
• scientific article; zbMATH DE number 5764899 (Why is no real title available?)
• scientific article; zbMATH DE number 2154968 (Why is no real title available?)
• Labelling Graphs with a Condition at Distance 2
• Linear and cyclic radio k-labelings of trees
• Multilevel Distance Labelings for Paths and Cycles
• Nearly antipodal chromatic number ac'(P_n) of the path P_n.
• Radio k-colorings of paths
• Radio labelings of graphs

Cited in

(1)

• A linear algorithm for radio k-coloring of powers of paths having small diameters

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6182900)