14 citations · 49 across the 22 of their papers we have counts for
24 papers
Cubic factor-invariant graphs of bialternating cycle quotient type
Primož Šparl
In 2019, investigation of the so-called factor-invariant cubic graphs was initiated by Alspach, Khodadadpour and Kreher. For a cubic graph and a vertex-transitive subgroup …
Self-reverse labelings of distance magic graphs
Petr Kovář, Ksenija Rozman, Primož Šparl
A graph is distance magic if it admits a bijective labeling of its vertices by integers from up to the order of the graph in such a way that the sum of the labels of all the ne…
An infinite family of simple graphs underlying chiral, orientable reflexible and non-orientable rotary maps
Isabel Hubard, Primož Potočnik, Primož Šparl
In this paper, we provide the first known infinite family of simple graphs, each of which is the skeleton of a chiral map, a skeleton of a reflexible map on an orientable surfaces,…
On the fractional matching extendability of Cayley graphs of Abelian groups
Boštjan Kuzman, Primož Šparl
Fractional matching extendability is a concept that brings together two widely studied topics in graph theory, namely that of fractional matchings and that of matching extendabilit…
Distance magic labelings of Cartesian products of cycles
Ksenija Rozman, Primož Šparl
A graph of order is distance magic if it admits a bijective labeling of its vertices with integers from to such that each vertex has the same sum of the labels of its n…
Tetravalent distance magic graphs of small order and an infinite family of examples
Ksenija Rozman, Primož Šparl
A graph of order is distance magic if it admits a bijective labeling of its vertices with integers from to such that each vertex has the same sum of the labels of its n…