3 citations · 9 across the 11 of their papers we have counts for
Showing math.COShow all
2 papers · 1 filter
math.CO2026
Optimization problem for star covers of graphs without four cycles
Damjana Kokol Bukovšek, Polona Oblak, Helena Šmigoc
This work presents a study of star covers on graphs. Unlike traditional formulations that minimize the number of stars, our aim is to optimize the number of bipartite components us…
math.CO2021
Paths are generically realisable
Rupert H. Levene, Polona Oblak, Helena Šmigoc
We show that every - multiplicity matrix for a simple graph is generically realisable for . In particular, every multiplicity matrix for a path is generically realisab…