57 citations · 309 across the 30 of their papers we have counts for
4 papers · 1 filter
Counting traversing Hamiltonian cycles in tiled graphs
Alen Vegi Kalamar
In this paper we extend counting of traversing Hamiltonian cycles from 2-tiled graphs to generalized tiled graphs. We further show that, for a fixed finite set of tiles, counting t…
Counting Hamiltonian cycles in 2-tiled graphs
Alen Vegi Kalamar, Tadej Žerak, Drago Bokal
In 1930, Kuratowski showed that and are the only two minor-minimal non-planar graphs. Robertson and Seymour extended finiteness of the set of forbidden minors for a…
Infinite arc-transitive and highly-arc-transitive digraphs
Rögnvaldur G. Möller, Primož Potočnik, Norbert Seifter
A detailed description of the structure of two-ended arc-transitive digraphs is given. It is also shown that several sets of conditions, involving such concepts as Property Z, loca…
Sharply -arc-transitive-digraphs: finite and infinite examples
Rögnvaldur G. Möller, Primož Potočnik, Norbert Seifter
A general method for constructing sharply -arc-transitive digraphs, i.e. digraphs that are -arc-transitive but not -arc-transitive, is presented. Using our method it i…