12 citations · 19 across the 2 of their papers we have counts for
2 papers
math.CO2012★ 12 cited
Even-cycle decompositions of graphs with no odd--minor
Tony Huynh, Sang-il Oum, Maryam Verdian-Rizi
An even-cycle decomposition of a graph G is a partition of E(G) into cycles of even length. Evidently, every Eulerian bipartite graph has an even-cycle decomposition. Seymour (1981…
math.CO2012★ 7 cited
Strongly even-cycle decomposable graphs
Tony Huynh, Andrew D. King, Sang-il Oum +1
A graph is strongly even-cycle decomposable if the edge set of every subdivision with an even number of edges can be partitioned into cycles of even length. We prove that several f…