Vasiliki Velona

activity

20182026

most citedStructure and enumeration of K4-minor-free links and link-diagrams

1 citations · 2 across the 5 of their papers we have counts for

collaborators

Showing math.COShow all

3 papers · 1 filter

math.CO2019

Minor-Obstructions for Apex Sub-unicyclic Graphs

Alexandros Leivaditis, Alexandros Singh, Giannos Stamoulis +3

A graph is sub-unicyclic if it contains at most one cycle. We also say that a graph $G$ is $k$ -apex sub-unicyclic if it can become sub-unicyclic by removing $k$ of its vertices. We…

math.CO2018★ 1 cited

Structure and enumeration of K4-minor-free links and link-diagrams

Juanjo Rué, Dimitrios M. Thilikos, Vasiliki Velona

We study the class L of link-types that admit a K4-minor-free diagram, i.e., they can be projected on the plane so that the resulting graph does not contain any subdivision of K4.…

math.CO2018

Encoding and avoiding 2-connected patterns in polygon dissections and outerplanar graphs

Vasiliki Velona

Let $Δ = {δ_{1}, δ_{2}, ..., δ_{m}}$ be a finite set of 2-connected patterns, i.e. graphs up to vertex relabelling. We study the generating function $D_{Δ} (z, u_{1}, u_{2}, ..., u_{m}),$ which cou…