4 citations · 4 across the 2 of their papers we have counts for
3 papers
cs.DS2017★ 4 cited
The Euler and Chinese Postman Problems on 2-Arc-Colored Digraphs
Bin Sheng, Ruijuan Li, Gregory Gutin
The famous Chinese Postman Problem (CPP) is polynomial time solvable on both undirected and directed graphs. Gutin et al. [Discrete Applied Math 217 (2016)] generalized these resul…
cs.DS2017
An improved kernel for the cycle contraction problem
Bin Sheng, Yuefang Sun
The problem of modifying a given graph to satisfy certain properties has been one of the central topics in parameterized tractability study. In this paper, we study the cycle contr…
math.CO2016
Odd Properly Colored Cycles in Edge-Colored Graphs
Gregory Gutin, Bin Sheng, Magnus Wahlström
It is well-known that an undirected graph has no odd cycle if and only if it is bipartite. A less obvious, but similar result holds for directed graphs: a strongly connected digrap…