Vesna Irsic Chenoweth

most citedSubgraph-universal planar graphs for trees

1 citations · 1 across the 2 of their papers we have counts for

collaborators

3 papers

math.CO2025

Revisiting $d$ -distance (independent) domination in trees and in bipartite graphs

Csilla Bujtás, Vesna Iršič Chenoweth, Sandi Klavžar +1

The $d$ -distance $p$ -packing domination number $γ_{d}^{p} (G)$ of $G$ is the minimum size of a set of vertices of $G$ which is both a $d$ -distance dominating set and a $p$ -packing. In 1…

math.CO2024

Weighted Padovan graphs

Vesna Iršič Chenoweth, Sandi Klavžar, Gregor Rus +1

Weighted Padovan graphs $Φ_{k}^{n}$ , $n \geq 1$ , $⌊ \frac{n}{2} ⌋ \leq k \leq ⌊ \frac{2 n - 2}{3} ⌋$ , are introduced as the graphs whose vertices are all Padov…

math.CO2024★ 1 cited

Subgraph-universal planar graphs for trees

Helena Bergold, Vesna Iršič, Robert Lauff +3

We show that there exists an outerplanar graph on $O (n^{c})$ vertices for $c = lo g_{2} (3 + 10) \approx 2.623$ that contains every tree on $n$ vertices as a subgraph. This exten…

Revisiting d-distance (independent) domination in trees and in bipartite graphs

Weighted Padovan graphs

Subgraph-universal planar graphs for trees

Revisiting $d$ -distance (independent) domination in trees and in bipartite graphs