Showing math.COShow all
2 papers · 1 filter
math.CO2026
Computing and Bounding the Number of Eulerian Orientations for Certain Classes of -Regular Graphs
Evangelos Bartzos, Michalis Samaris
An Eulerian orientation of a -regular undirected graph (simple or multigraph) with vertices is an assignment of directions to its edges such that every vertex…
math.CO2020
New upper bounds for the number of embeddings of minimally rigid graphs
Evangelos Bartzos, Ioannis Z. Emiris, Raimundas Vidunas
By definition, a rigid graph in (or on a sphere) has a finite number of embeddings up to rigid motions for a given set of edge length constraints. These embeddings a…