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

DOI10.1016/J.JCSS.2024.103577MaRDI QIDQ6627041

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

Publication date: 29 October 2024

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

zbMATH Keywords

pathgraph colouringlinear time algorithmchannel assignment problem

Mathematics Subject Classification ID

Paths and cycles (05C38) Coloring of graphs and hypergraphs (05C15) Distance in graphs (05C12) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Graph algorithms (graph-theoretic aspects) (05C85) Simple groups: alternating groups and groups of Lie type (20D06)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Antipodal number of some powers of cycles
• A lower bound technique for radio \(k\)-coloring
• A survey on radio \(k\)-colorings of graphs
• A linear time algorithm for \(L(2,1)\)-labeling of trees
• Radio labelings of distance graphs
• Radio labelings of graphs
• Nearly antipodal chromatic number $ac'(P_n)$ of the path $P_n$
• Labelling Graphs with a Condition at Distance 2
• Approximations for  -Colorings of Graphs
• Radio k-colorings of paths
• Linear and cyclic radio k-labelings of trees
• Multilevel Distance Labelings for Paths and Cycles
• Automata, Languages and Programming
• Fixed-parameter complexity of \(\lambda\)-labelings
• On radio \(k\)-labeling of the power of the infinite path
• A linear algorithm for radio \(k\)-coloring powers of paths having small diameter

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

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