Martin Rolek

activity

20182021

most citedFat-triangle linkage and kite-linked graphs

2 citations · 4 across the 4 of their papers we have counts for

collaborators

8 papers

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.CO2019★ 1 cited

Connectivity for Kite-Linked Graphs

Chris Stephens, Dong Ye

For a given graph $H$ , a graph $G$ is $H$ -linked if, for every injection $φ : V (H) \to V (G)$ , the graph $G$ contains a subdivision of $H$ with $φ (v)$ corresponding to $v$ , for each…

math.CO2019★ 1 cited

Packing $(1, 1, 2, 2)$ -coloring of some subcubic graphs

Runrun Liu, Xujun Liu, Martin Rolek +1

For a sequence of non-decreasing positive integers $S = (s_{1}, \dots, s_{k})$ , a packing $S$ -coloring is a partition of $V (G)$ into sets $V_{1}, \dots, V_{k}$ such that for each $1\leq…

math.CO2019★ 2 cited

Fat-triangle linkage and kite-linked graphs

Runrun Liu, Martin Rolek, Gexin Yu

For a multigraph $H$ , a graph $G$ is $H$ -linked if every injective mapping $ϕ : V (H) \to V (G)$ can be extended to an $H$ -subdivision in $G$ . We study the minimum connectivity require…

math.CO2018

Minimum degree condition for a graph to be knitted

Runrun Liu, Martin Rolek, Gexin Yu

For a positive integer $k$ , a graph is $k$ -knitted if for each $k$ -subset $S$ of vertices, and every partition of $S$ into disjoint parts $S_{1}, \dots, S_{t}$ for some $t \geq 1$ , one…

math.CO2018

DP-3-coloring of planar graphs without $4, 9$ -cycles and two cycles from ${5, 6, 7, 8}$

Runrun Liu, Sarah Loeb, Martin Rolek +2

A generalization of list-coloring, now known as DP-coloring, was recently introduced by Dvořák and Postle. Essentially, DP-coloring assigns an arbitrary matching between lists of c…