D. Stephens

activity

20162026

most citedEquitable coloring of sparse planar graphs

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

collaborators

3 papers

math.CO2026

Integer Flows on Cyclic Covers of Graphs

Rong Luo, Yuying Ma, D. Christopher Stephens +1

Graph covers preserve the local structure of a graph while allowing its global structure to change substantially. In this paper, we study how such changes in cyclic covers affect n…

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.CO2016★ 9 cited

Equitable coloring of sparse planar graphs

Rong Luo, Jean-Sébastien Sereni, D. Christopher Stephens +1

A proper vertex coloring of a graph $G$ is equitable if the sizes of color classes differ by at most one. The equitable chromatic threshold $χ_{e q}^{*} (G)$ of $G$ is the smallest int…