18 citations · 21 across the 5 of their papers we have counts for
4 papers · 1 filter
Counting One-Vertex Maps
Alen Orbanic, Marko Petkovsek, Tomaz Pisanski +1
The number of distinct maps (pre-maps) with a single vertex and valence is computed for any value of . The types of maps (pre-maps) that we consider depend on whether the un…
Distance-residual graphs
Primoz Luksic, Tomaz Pisanski
If we are given a connected finite graph and a subset of its vertices , we define a distance-residual graph as a graph induced on the set of vertices that have the maxim…
Semisymmetric Graphs from Polytopes
Barry Monson, Tomaz Pisanski, Egon Schulte +1
Every finite, self-dual, regular (or chiral) 4-polytope of type {3,q,3} has a trivalent 3-transitive (or 2-transitive) medial layer graph. Here, by dropping self-duality, we obtain…
Multiple Kronecker Covering Graphs
Tomaz Pisanski, Wilfried Imrich
A graph may be the Kronecker cover in more than one way. In this note we explore this phenomenon. Using this approach we show that the least common cover of two graphs need not be…