Tibor Jordán

activity

20222026

most citedPartial reflections and globally linked pairs in rigid graphs

3 citations · 7 across the 7 of their papers we have counts for

collaborators

Showing 2024Show all

2 papers · 1 filter

math.CO2024

Globally linked pairs and cheapest globally rigid supergraphs

Tibor Jordán, Soma Villányi

Given a graph $G$ , a cost function on the non-edges of $G$ , and an integer $d$ , the problem of finding a cheapest globally rigid supergraph of $G$ in $R^{d}$ is NP-hard for…

math.CO2024★ 1 cited

Highly connected orientations from edge-disjoint rigid subgraphs

Dániel Garamvölgyi, Tibor Jordán, Csaba Király +1

We give an affirmative answer to a long-standing conjecture of Thomassen, stating that every sufficiently highly connected graph has a $k$ -vertex-connected orientation. We prove th…