10 citations · 44 across the 12 of their papers we have counts for
5 papers · 1 filter
Computing distances in braid-move graphs, higher Bruhat orders, and oriented-matroid mutation graphs is NP-hard
Tilen Marc
A reduced word of the longest permutation , taken up to commutations, encodes a wiring diagram of pseudolines, and a braid move $σ_iσ_{i+1}σ_i\leftrightarrowσ_{i+1}…
Classification of vertex-transitive cubic partial cubes
Tilen Marc
Partial cubes are graphs isometrically embeddable into hypercubes. In this paper it is proved that every cubic, vertex-transitive partial cube is isomorphic to one of the following…
There are no finite partial cubes of girth more than 6 and minimum degree at least 3
Tilen Marc
Partial cubes are graphs isometrically embeddable into hypercubes. We analyze how isometric cycles in partial cubes behave and derive that every partial cube of girth more than 6 m…
The Relaxed Square Property
Marc Hellmuth, Tilen Marc, Lydia Ostermeier +1
Graph products are characterized by the existence of non-trivial equivalence relations on the edge set of a graph that satisfy a so-called square property. We investigate here a ge…
On the Cartesian Skeleton and the Factorization of the Strong Product of Digraphs
Marc Hellmuth, Tilen Marc
The three standard products (the Cartesian, the direct and the strong product) of undirected graphs have been wellinvestigated, unique prime factor decomposition (PFD) are known an…