Sedlar–Škrekovski's mixed metric dimension conjecture

Let $G$ be a connected graph that is not a cycle. Write $O(G)=V(G)\cup E(G)$, let $\operatorname{dim_m}(G)$ denote the minimum cardinality of a mixed metric generator of $G$, let $\ell(G)$ be the number of leaves of $G$, and let

$$c(G)=|E(G)|-|V(G)|+1$$

be its cyclomatic number. Sedlar–Škrekovski's conjecture.

$$\operatorname{dim_m}(G)\leq \ell(G)+2c(G).$$

Sedlar and Škrekovski proposed this bound after determining the mixed metric dimension of unicyclic graphs. The conjecture concerns the mixed metric dimension of connected graphs beyond cycles; its resolution is not established in the supplied source.