H. Guler

activity

20112026

most citedRigidity of linearly-constrained frameworks

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

collaborators

8 papers

math.CO2026

On Generic Linearly Constrained Frameworks

Zakir Deniz, Hakan Guler, Anthony Nixon

A linearly constrained framework in $R^{d}$ is a bar-joint framework where, in addition, vertices with loops are constrained to lie in given affine subspaces. In the generic…

math.CO2025

A sufficient condition for planar graphs with maximum degree eight to be totally 9-colorable

Zakir Deniz, Hakan Guler

A total coloring of a graph $G$ is a coloring of the vertices and edges such that two adjacent or incident elements receive different colors. The minimum number of colors required…

math.CO2021

A sufficient connectivity condition for rigidity and global rigidity of linearly constrained frameworks in $R^{2}$

Hakan Guler

We study the bar-and-joint frameworks in $R^{2}$ such that some vertices are constrained to lie on some lines. The generic rigidity of such frameworks is characterised by St…

math.CO2021★ 2 cited

Coincident Rigidity of 2-Dimensional Frameworks

Hakan Guler, Bill Jackson

Fekete, Jordán and Kaszanitzky [4] characterised the graphs which can be realised as 2-dimensional, infinitesimally rigid, bar-joint frameworks in which two given vertices are coin…

math.CO2020

Flexible circuits in the $d$ -dimensional rigidity matroid

Georg Grasegger, Hakan Guler, Bill Jackson +1

A bar-joint framework $(G, p)$ in $R^{d}$ is rigid if the only edge-length preserving continuous motions of the vertices arise from isometries of $R^{d}$ . It is known…

math.CO2019★ 5 cited

Global rigidity of 2-dimensional linearly constrained frameworks

Hakan Guler, Bill Jackson, Anthony Nixon

A linearly constrained framework in $R^{d}$ is a point configuration together with a system of constraints which fixes the distances between some pairs of points and additio…

math.CO2018★ 12 cited

Rigidity of linearly-constrained frameworks

James Cruickshank, Hakan Guler, Bill Jackson +1

We consider the problem of characterising the generic rigidity of bar-joint frameworks in $R^{d}$ in which each vertex is constrained to lie in a given affine subspace. The…

math.CO2011★ 4 cited

A necessary condition for generic rigidity of bar-and-joint frameworks in $d$ -space

Bill Jackson, Hakan Guler

A graph $G = (V, E)$ is $d$ -sparse if each subset $X \subseteq V$ with $∣ X ∣ \geq d$ induces at most $d ∣ X ∣ - (2 d + 1)$ edges in $G$ . Maxwell showed in 1864 that a necessary condit…