Distance labellings of graphs
From MaRDI portal
Recommendations
Cited in
(26)- Undirected distances and the postman-structure of graphs
- On the \(L\)(2,~1)-labeling conjecture for brick product graphs
- A note on exact distance labeling
- Distance-constrained labellings of Cartesian products of graphs
- Distance labeling in graphs (extended abstract)
- L(2,1)-labeling of a circular graph.
- L(2,l)-labellings of integer distance graphs
- Pair Labellings with Given Distance
- Distance and routing labeling schemes for non-positively curved plane graphs
- Distance Labeling for Permutation Graphs
- Distance Labelling Problems for Hypercubes and Hamming Graphs – A Survey
- Graph Distances in the Data-Stream Model
- L(2,1)-labelings on the modular product of two graphs
- Labelling Graphs with a Condition at Distance 2
- L(2,1)-labelling of generalized prisms
- scientific article; zbMATH DE number 1124605 (Why is no real title available?)
- Sublinear Distance Labeling
- Graph distance‐dependent labeling related to code assignment in computer networks
- Graph distances using graph union
- On the $\lambda$-Number of $Q_n $ and Related Graphs
- scientific article; zbMATH DE number 1409224 (Why is no real title available?)
- Distance Labels with Optimal Local Stretch
- \(L(2,1)\)-labelings on some products of \(n\) general graphs.
- On L(2,1)-labellings of distance graphs
- scientific article; zbMATH DE number 7637429 (Why is no real title available?)
- The \(L(2,1)\)-labeling on Cartesian sum of graphs
This page was built for publication: Distance labellings of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5397204)
