Pages that link to "Item:Q405298"
From MaRDI portal
The following pages link to On the strong partition dimension of graphs (Q405298):
Displaying 16 items.
- The partition dimension of strong product graphs and Cartesian product graphs (Q397144) (← links)
- Strong-diameter decompositions of minor free graphs (Q613118) (← links)
- The Borsuk dimension of a graph and Borsuk's partition conjecture for finite sets (Q1173653) (← links)
- Uniquely identifying the edges of a graph: the edge metric dimension (Q1627862) (← links)
- On graphs with the maximum edge metric dimension (Q1730253) (← links)
- Mixed metric dimension of graphs (Q1740116) (← links)
- Edge metric dimensions via hierarchical product and integer linear programming (Q2047193) (← links)
- Edge metric dimension and mixed metric dimension of planar graph \(Q_n\) (Q2166263) (← links)
- Further new results on strong resolving partitions for graphs (Q2189231) (← links)
- On the \(k\)-partition dimension of graphs (Q2285123) (← links)
- Termination of the iterated strong-factor operator on multipartite graphs (Q2512660) (← links)
- (Q4649980) (← links)
- STRONG COLORINGS OVER PARTITIONS (Q5009680) (← links)
- The Edge Partition Dimension of Graphs (Q5889976) (← links)
- Strong resolving partitions for strong product graphs and Cartesian product graphs (Q5962517) (← links)
- A strong formulation for the graph partition problem (Q6068542) (← links)
