activity
20162024
most citedAn improved lower bound for the planar Turán number of cycles

2 citations · 3 across the 7 of their papers we have counts for

collaborators

7 papers

math.CO2024

On tight -stable graphs

Xiaonan Liu, Zi-Xia Song, Zhiyu Wang

For integers , a graph is -stable if for every with . A recent result of Dong and Wu [SIAM J. Discrete Mat…

math.CO2023

Minimizing the number of edges in -co-critical graphs

Gang Chen, Chenchen Ren, Zi-Xia Song

Given graphs , a {red, blue}-coloring of the edges of a graph is a critical coloring if has neither a red nor a blue . A non-complete graph is $(H…

math.CO20222 cited

An improved lower bound for the planar Turán number of cycles

Yongxin Lan, Zi-Xia Song

The planar Turán number of a graph , denoted by , is the largest number of edges in a planar graph on vertices without containing as a subgraph.…

math.CO2022

Every graph with no minor is -colorable

Michael Lafferty, Zi-Xia Song

Hadwiger's Conjecture from 1943 states that every graph with no minor is -colorable; it remains wide open for all . For positive integers and , let $\…

math.CO2022

Properties of -contraction-critical graphs with no minor

Martin Rolek, Zi-Xia Song, Robin Thomas

Motivated by the famous Hadwiger's Conjecture, we study the properties of -contraction-critical graphs with no minor; we prove that every -contraction-critical graph wi…

math.CO2016

Double-critical graph conjecture for claw-free graphs

Martin Rolek, Zi-Xia Song

A connected graph with chromatic number is double-critical if is -colorable for each edge . The complete graphs are the only k…