Yiqiao Wang

activity

20122026

most citedEvery 4-regular graph is acyclically edge-6-colorable

4 citations · 4 across the 8 of their papers we have counts for

collaborators

Showing 2021Show all

2 papers · 1 filter

math.CO2021

On critical graphs for the chromatic edge-stability number

Hui Lei, Xiaopan Lian, Xianhao Meng +2

The {\em chromatic edge-stability number} $e s_{χ} (G)$ of a graph $G$ is the minimum number of edges whose removal results in a spanning subgraph with the chromatic number smaller tha…

math.CO2021

The saturation number of $C_{6}$

Yongxin Lan, Yongtang Shi, Yiqiao Wang +1

A graph $G$ is called $C_{k}$ -saturated if $G$ is $C_{k}$ -free but $G + e$ not for any $e \in E (G)$ . The saturation number of $C_{k}$ , denoted $s a t (n, C_{k})$ , is the minimum number…

On critical graphs for the chromatic edge-stability number

The saturation number of C6​

The saturation number of $C_{6}$