24 citations · 111 across the 46 of their papers we have counts for
7 papers · 1 filter
A new upper bound on the chromatic number of graphs with no odd minor
Sergey Norin, Zi-Xia Song
Gerards and Seymour conjectured that every graph with no odd minor is -colorable. This is a strengthening of the famous Hadwiger's Conjecture. Geelen et al. proved tha…
Breaking the degeneracy barrier for coloring graphs with no minor
Sergey Norin, Luke Postle, Zi-Xia Song
In 1943, Hadwiger conjectured that every graph with no minor is -colorable for every . In the 1980s, Kostochka and Thomason independently proved that every gr…
Antimagic orientations of graphs with given independence number
Zi-Xia Song, Donglei Yang, Fangfang Zhang
Given a digraph with arcs and a bijection , we say is an antimagic orientation of a graph if is an orientation of $…
Antimagic orientations of graphs with large maximum degree
Donglei Yang, Joshua Carlson, Andrew Owens +5
Given a digraph with arcs, a bijection is an antimagic labeling of if no two vertices in have the same vertex-sum, where t…
Gallai-Ramsey number of even cycles with chords
Fangfang Zhang, Zi-Xia Song, Yaojun Chen
For a graph and an integer , the -color Ramsey number is the least integer such that every -coloring of the edges of the complete graph contains…
A note on Gallai-Ramsey number of even wheels
Zi-Xia Song, Bing Wei, Fangfang Zhang +1
A Gallai coloring of a complete graph is an edge-coloring such that no triangle has all its edges colored differently. A Gallai -coloring is a Gallai coloring that uses colo…
On the size of -co-critical graphs
Zi-Xia Song, Jingmei Zhang
Given an integer and graphs , we write if every -coloring of the edges of contains a monochromatic copy o…