47 citations · 678 across the 85 of their papers we have counts for
4 papers · 1 filter
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…
Dynamic coloring of graphs having no minor
Younjin Kim, Sang June Lee, Sang-il Oum
We prove that every simple connected graph with no minor admits a proper 4-coloring such that the neighborhood of each vertex having more than one neighbor is not monochr…
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…
Graphs of Small Rank-width are Pivot-minors of Graphs of Small Tree-width
O-joung Kwon, Sang-il Oum
We prove that every graph of rank-width is a pivot-minor of a graph of tree-width at most . We also prove that graphs of rank-width at most 1, equivalently distance-heredit…