Rain Jiang

most citedLinking disjoint segments into a simple polygon is hard

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

collaborators

Showing math.COShow all

3 papers · 1 filter

math.CO2021

Vertebrate interval graphs

Rain Jiang, Kai Jiang, Minghui Jiang

A vertebrate interval graph is an interval graph in which the maximum size of a set of independent vertices equals the number of maximal cliques. For any fixed $v \geq 1$ , there is…

math.CO2021★ 1 cited

Partitioning an interval graph into subgraphs with small claws

Rain Jiang, Kai Jiang, Minghui Jiang

The claw number of a graph $G$ is the largest number $v$ such that $K_{1, v}$ is an induced subgraph of $G$ . Interval graphs with claw number at most $v$ are cluster graphs when $v…

math.CO2021

Caterpillars and alternating paths

Rain Jiang, Kai Jiang, Minghui Jiang

Let $p (m)$ (respectively, $q (m)$ ) be the maximum number $k$ such that any tree with $m$ edges can be transformed by contracting edges (respectively, by removing vertices) into a ca…