The Edge Partition Dimension of Graphs
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3494441 (Why is no real title available?)
- scientific article; zbMATH DE number 3544092 (Why is no real title available?)
- On Metric Generators of Graphs
- On the strong partition dimension of graphs
- On upper dimension of graphs and their bases sets
- The metric chromatic number of a graph
- The partition dimension of a graph
- Uniquely identifying the edges of a graph: the edge metric dimension
Cited in
(6)- Finding the edge ranking number through vertex partitions
- Mixed partition functions and exponentially bounded edge-connection rank
- scientific article; zbMATH DE number 5844285 (Why is no real title available?)
- scientific article; zbMATH DE number 19193 (Why is no real title available?)
- Characterizing partition functions of the edge-coloring model by rank growth
- Edge Partitions and Visibility Representations of 1-planar Graphs
This page was built for publication: The Edge Partition Dimension of Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5889976)