Radio \(k\)-chromatic number of full \(m\)-ary trees
From MaRDI portal
Publication:2075390
DOI10.1007/s00224-021-10056-7zbMath1482.05304OpenAlexW3193810185MaRDI QIDQ2075390
Satyabrata Das, Laxman Saha, Alamgir Rahaman Basunia, Kalishankar Tiwary
Publication date: 14 February 2022
Published in: Theory of Computing Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00224-021-10056-7
Graph theory (including graph drawing) in computer science (68R10) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Channel models (including quantum) in information and communication theory (94A40)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the radio number of square of graphs
- A lower bound for radio \(k\)-chromatic number
- A lower bound technique for radio \(k\)-coloring
- Optimal radio labellings of complete \(m\)-ary trees
- Antipodal number of full \(m\)-ary trees
- Antipodal radio labelling of full binary trees
- Improved lower bounds for the radio number of trees
- Radio number for trees
- The Radio Number of $C_n \square C_n$
- A Graph Radio k-Coloring Algorithm
- ON RADIO NUMBER OF POWER OF CYCLES
- Radio numbers for generalized prism graphs
- Upper bound for radio -chromatic number of graphs in connection with partition of vertex set
- Radio $k$-labeling of paths
- Multilevel Distance Labelings for Paths and Cycles
This page was built for publication: Radio \(k\)-chromatic number of full \(m\)-ary trees