8 citations · 18 across the 10 of their papers we have counts for
25 papers
Every graph with no minor is -colorable
Michael Lafferty, Zi-Xia Song
For positive integers and , let denote the family of graphs obtained from the complete graph by removing edges. A graph has no $\mathcal{K…
Planar Turán numbers of cubic graphs and disjoint union of cycles
Yongxin Lan, Yongtang Shi, Zi-Xia Song
The planar Turán number of a graph , denoted , is the maximum number of edges in a planar graph on vertices without containing as a subgraph. Thi…
On the size of special class 1 graphs and -co-critical graphs
Gang Chen, Zhengke Miao, Zi-Xia Song +1
A well-known theorem of Vizing states that if is a simple graph with maximum degree , then the chromatic index of is or . A graph is class 1 if $χ'(…
Some remarks on even-hole-free graphs
Zi-Xia Song
A vertex of a graph is bisimplicial if the set of its neighbors is the union of two cliques; a graph is quasi-line if every vertex is bisimplicial. A recent result of Chudnovsky an…
On the size of -co-critical graphs
Hunter Davenport, Zi-Xia Song, Fan Yang
Given graphs , we write if every red, blue-coloring of the edges of contains a red copy of or a blue copy of . A no…
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…