48 citations · 253 across the 49 of their papers we have counts for
Showing 2025Show all
2 papers · 1 filter
math.CO2025
Proper conflict-free degree-choosability of outerplanar graphs
Masaki Kashima, Riste Škrekovski, Rongxing Xu
A proper coloring of is called a proper conflict-free coloring of if for every non-isolated vertex of , there is a color such that …
math.CO2025
Invitation to the subpath number
Martin Knor, Jelena Sedlar, Riste Škrekovski +1
In this paper we count all the subpaths of a given graph G; including the subpaths of length zero, and we call this quantity the subpath number of G. The subpath number is related…