E-LIB Suche - Ergebnisse für: Jordán, Tibor

1

Count and cofactor matroids of highly connected graphs:

Garamvölgyi, Dániel ; Jordán, Tibor ; Király, Csaba
Journal of Combinatorial Theory, Series B. 166 (2024) - p. 1-29 , 2024

Link: https://doi.org/10.1016/..

2

Four-regular graphs with extremal rigidity properties:

Jordán, Tibor ; Huang, Robin ; Simmons, Henry..
Discrete Mathematics. 347 (2024) 4 - p. 113833 , 2024

Link: https://doi.org/10.1016/..

3

Globally Linked Pairs of Vertices in Generic Frameworks:

Jordán, Tibor ; Villányi, Soma
Combinatorica. 44 (2024) 4 - p. 817-838 , 2024

Link: https://doi.org/10.1007/..

4

Partial Reflections and Globally Linked Pairs in Rigid Grap..:

Garamvölgyi, Dániel ; Jordán, Tibor
SIAM Journal on Discrete Mathematics. 38 (2024) 3 - p. 2005-2040 , 2024

Link: https://doi.org/10.1137/..

5

Ear‐decompositions, minimally connected matroids and rigid ..:

Jordán, Tibor
Journal of Graph Theory. 105 (2023) 3 - p. 451-467 , 2023

Link: https://doi.org/10.1002/..

6

Minimally globally rigid graphs:

Garamvölgyi, Dániel ; Jordán, Tibor
European Journal of Combinatorics. 108 (2023) - p. 103626 , 2023

Link: https://doi.org/10.1016/..

7

Rigid block and hole graphs with a single block:

Jordán, Tibor
Discrete Mathematics. 346 (2023) 3 - p. 113268 , 2023

Link: https://doi.org/10.1016/..

8

Extremal families of redundantly rigid graphs in three dime..:

Jordán, Tibor ; Poston, Christopher ; Roach, Ryan
Discrete Applied Mathematics. 322 (2022) - p. 448-464 , 2022

Link: https://doi.org/10.1016/..

9

Globally rigid graphs are fully reconstructible:

Garamvölgyi, Dániel ; Gortler, Steven J. ; Jordán, Tibor
Forum of Mathematics, Sigma. 10 (2022) - p. , 2022

Link: https://doi.org/10.1017/..

10

Rigidity of Random Subgraphs and Eigenvalues of Stiffness M..:

Jordán, Tibor ; Tanigawa, Shin-ichi
SIAM Journal on Discrete Mathematics. 36 (2022) 3 - p. 2367-2392 , 2022

Link: https://doi.org/10.1137/..

11

Globally rigid powers of graphs:

Jordán, Tibor ; Tanigawa, Shin-ichi
Journal of Combinatorial Theory, Series B. 155 (2022) - p. 111-140 , 2022

Link: https://doi.org/10.1016/..

12

Minimum Size Highly Redundantly Rigid Graphs in the Plane:

Jordán, Tibor
Graphs and Combinatorics. 37 (2021) 4 - p. 1415-1431 , 2021

Link: https://doi.org/10.1007/..

13

A note on generic rigidity of graphs in higher dimension:

Jordán, Tibor
Discrete Applied Mathematics. 297 (2021) - p. 97-101 , 2021

Link: https://doi.org/10.1016/..

14

Graph Reconstruction from Unlabeled Edge Lengths:

Garamvölgyi, Dániel ; Jordán, Tibor
Discrete & Computational Geometry. 66 (2021) 1 - p. 344-385 , 2021

Link: https://doi.org/10.1007/..

15

The Steiner Problem for Count Matroids:

, In: Lecture Notes in Computer Science; Combinatorial Algorithms,

Jordán, Tibor ; Kobayashi, Yusuke ; Mahara, Ryoga. - p. 330-342 , 2020

Link: https://doi.org/10.1007/..