Recommendations
Cites work
Cited in
(7)- Path locality of some complete bipartite graphs
- On the locatic number of graphs
- Bounds on the connected local dimension of graphs in terms of the marked dimension and the clique number
- LOCALLY-BALANCED k-PARTITIONS OF GRAPHS
- Effective localization number: Building k-surviving degrees
- scientific article; zbMATH DE number 5270874 (Why is no real title available?)
- On the tight boundary of the locating rainbow connection numbers of the edge-comb product of several graphs
This page was built for publication: The local partition dimension of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5013475)