8 citations · 21 across the 14 of their papers we have counts for
Showing 2019Show all
3 papers · 1 filter
math.CO2019★ 2 cited
Jungerman ladders and index 2 constructions for genus embeddings of dense regular graphs
Timothy Sun
We construct several families of minimum genus embeddings of dense graphs using index 2 current graphs. In particular, we complete the genus formula for the octahedral graphs, solv…
cs.DS2019
A Lower Bound on Cycle-Finding in Sparse Digraphs
Xi Chen, Tim Randolph, Rocco A. Servedio +1
We consider the problem of finding a cycle in a sparse directed graph that is promised to be far from acyclic, meaning that the smallest feedback arc set in is large. We pr…
math.CO2019★ 1 cited
Simultaneous current graph constructions for minimum triangulations and complete graph embeddings
Timothy Sun
The problems of the genus of the complete graphs and minimum triangulations for each surface were both solved using the theory of current graphs, and each of them divided into twel…