4 citations · 5 across the 5 of their papers we have counts for
Showing math.COShow all
2 papers · 1 filter
math.CO2020★ 1 cited
The Paired Domination Number of Cubic Graphs
Bin Sheng, Changhong Lu
Let G be a simple undirected graph with no isolated vertex. A paired dominating set of G is a dominating set which induces a subgraph that has a perfect matching. The paired domina…
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…