58 citations · 151 across the 35 of their papers we have counts for
Showing 2016Show all
3 papers · 1 filter
cs.DS2016
-Distinct In- and Out-Branchings in Digraphs
Gregory Gutin, Felix Reidl, Magnus Wahlström
An out-branching and an in-branching of a digraph are called -distinct if each of them has arcs absent in the other. Bang-Jensen, Saurabh and Simonsen (2016) proved that…
math.CO2016★ 5 cited
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…
cs.DM2016
Acyclicity in Edge-Colored Graphs
Gregory Gutin, Mark Jones, Bin Sheng +2
A walk in edge-colored graphs is called properly colored (PC) if every pair of consecutive edges in is of different color. We introduce and study five types of PC acyclicit…