New results on radio \(k\)-labelings of distance graphs
From MaRDI portal
Publication:2161267
DOI10.1016/J.DAM.2021.09.007zbMath1497.05237OpenAlexW3202122903WikidataQ113877218 ScholiaQ113877218MaRDI QIDQ2161267
Zehui Shao, Aleksander Vesel, Danilo Korže
Publication date: 4 August 2022
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2021.09.007
Integer programming (90C10) Linear programming (90C05) Distance in graphs (05C12) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)
Related Items (2)
General position sets in two families of Cartesian product graphs ⋮ On \(\lambda\)-backbone coloring of cliques with tree backbones in linear time
Cites Work
- Unnamed Item
- On distance constrained labeling of disk graphs
- Modeling the packing coloring problem of graphs
- Radio labelings of distance graphs
- Radio k-labelings for Cartesian products of graphs
- 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
- On the packing chromatic number of Cartesian products, hexagonal lattice, and trees
This page was built for publication: New results on radio \(k\)-labelings of distance graphs