15 citations · 77 across the 40 of their papers we have counts for
Showing 2021Show all
2 papers · 1 filter
math.CO2021
Sufficient conditions for 2-dimensional global rigidity
Xiaofeng Gu, Wei Meng, Martin Rolek +2
The 2-dimensional global rigidity has been shown to be equivalent to 3-connectedness and redundant rigidity by a combination of two results due to Jackson and Jordán, and Connelly,…
math.CO2021
Planar graphs without short even cycles are near-bipartite
Runrun Liu, Gexin Yu
A graph is {\em near-bipartite} if its vertex set can be partitioned into an independent set and a set that induces a forest. It is clear that near-bipartite graphs are -colorab…