4 papers
On Cyclic Edge-Connectivity of Fullerenes
Klavdija Kutnar, Dragan Marusic
A graph is said to be cyclic -edge-connected, if at least edges must be removed to disconnect it into two components, each containing a cycle. Such a set of edges is cal…
On quartic half-arc-transitive metacirculants
Dragan Marusic, Primoz Sparl
Following Alspach and Parsons, a {\em metacirculant graph} is a graph admitting a transitive group generated by two automorphisms and , where is -semiregular for…
On 2-Fold Covers of Graphs
Yan-Quan Feng, Klavdija Kutnar, Aleksander Malnic +1
A regular covering projection $\p\colon \tX \to X$ of connected graphs is -admissible if lifts along $\p$. Denote by $\tG$ the lifted group, and let $\CT(\p)$ be the group o…
Hamiltonicity of Cubic Cayley Graphs
Henry Glover, Dragan Marusic
Following a problem posed by Lovász in 1969, it is believed that every connected vertex-transitive graph has a Hamilton path. This is shown here to be true for cubic Cayley graphs…