The following pages link to Dorota Kuziak (Q251334):
Displaying 43 items.
- On the strong metric dimension of product graphs (Q283695) (← links)
- The security number of strong grid-like graphs (Q329713) (← links)
- Maximal 2-rainbow domination number of a graph (Q334128) (← links)
- Closed formulae for the strong metric dimension of lexicographic product graphs (Q339497) (← links)
- Coloring, location and domination of corona graphs (Q372395) (← links)
- The partition dimension of strong product graphs and Cartesian product graphs (Q397144) (← links)
- On the strong metric dimension of Cartesian and direct products of graphs (Q400431) (← links)
- Computing the metric dimension of a graph from primary subgraphs (Q503686) (← links)
- Resolvability and strong resolvability in the direct product of graphs (Q511842) (← links)
- (Q639102) (redirect page) (← links)
- On the metric dimension of corona product graphs (Q639103) (← links)
- Bounding the open \(k\)-monopoly number of strong product graphs (Q1692650) (← links)
- Strong resolving graphs: the realization and the characterization problems (Q1693153) (← links)
- Mixed metric dimension of graphs (Q1740116) (← links)
- On the strong metric dimension of corona product graphs and join graphs (Q1949107) (← links)
- Relating the outer-independent total Roman domination number with some classical parameters of graphs (Q2141037) (← links)
- Further new results on strong resolving partitions for graphs (Q2189231) (← links)
- A constructive characterization of vertex cover Roman trees (Q2214322) (← links)
- A Steiner general position problem in graph theory (Q2245772) (← links)
- On the strong metric dimension of the strong products of graphs (Q2257466) (← links)
- Erratum to ``On the strong metric dimension of the strong products of graphs'' (Q2257482) (← links)
- Outer-independent total Roman domination in graphs (Q2328098) (← links)
- Total Roman domination in the lexicographic product of graphs (Q2420413) (← links)
- Further contributions on the outer multiset dimension of graphs (Q2680828) (← links)
- Nonlocal metric dimension of graphs (Q2693833) (← links)
- The metric dimension of strong product graphs (Q2806647) (← links)
- (Q2829057) (← links)
- Open k-monopolies in graphs: complexity and related concepts (Q2965978) (← links)
- On the Strong Metric Dimension of Cartesian Sum Graphs (Q3187017) (← links)
- (Q3565849) (← links)
- (Q4591109) (← links)
- On global (strong) defensive alliances in some product graphs (Q4598302) (← links)
- (Q5206369) (← links)
- Computing the (k-)monopoly number of direct product of graphs (Q5278637) (← links)
- (Q5401052) (← links)
- On maximal Roman domination in graphs (Q5739600) (← links)
- Strong metric dimension of rooted product graphs (Q5739613) (← links)
- The Edge Partition Dimension of Graphs (Q5889976) (← links)
- Domination-related parameters in rooted product graphs (Q5964910) (← links)
- Total mutual-visibility in graphs with emphasis on lexicographic and Cartesian products (Q6090820) (← links)
- Maker-Breaker resolving game played on corona products of graphs (Q6733500) (← links)
- Coloring the vertices of a graph with mutual-visibility property (Q6739492) (← links)
- General position problems in strong and lexicographic products of graphs (Q6742136) (← links)
