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

9 papers

math.CO2026

Degeneracy bounds, stability, and a sharp gap for $B$ -colorings

Xiaoxue Hu, Jiangxu Kong, Yiqiao Wang

A $B$ -coloring of a graph is a proper edge-coloring in which every $4$ -cycle is rainbow, and $q_{B} (G)$ denotes the minimum number of colors in such a coloring. Let $Δ_{2} (G)$ denote t…

math.CO2026

1-Planar graphs without 6-cycles are 6-choosable

Qingqin Wu, Yiqiao Wang

A graph is 1-planar if it can be drawn in the plane so that each edge is crossed by at most one other edge. A graph is $k$ -degenerate if each of its subgraphs contains a vertex of…

math.CO2026

Feedback-arc robustness in random orientations of pseudorandom triangle-free graphs

Hui Lei, Danning Wang, Yiqiao Wang

For an oriented graph $D$ , let $α (D)$ be the maximum order of an induced acyclic subdigraph, $χ (D)$ its dichromatic number, and $fas (D)$ the minimum number of arcs…

math.CO2026

D-coloring of planar graphs

Xiaoxue Hu, Jiangxu Kong, Yiqiao Wang

A proper edge-coloring of a graph $G$ is a D-coloring if every subgraph isomorphic to $K_{4} - e$ is rainbow. The minimum number of colors in such a coloring is the D-chromatic index $…

math.CO2022

The strong chromatic index of 1-planar graphs

Yiqiao Wang, Ning Song, Jianfeng Wang +1

The chromatic index $χ^{'} (G)$ of a graph $G$ is the smallest $k$ for which $G$ admits an edge $k$ -coloring such that any two adjacent edges have distinct colors. The strong chromatic…

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…

math.CO2012★ 4 cited

Every 4-regular graph is acyclically edge-6-colorable

Wang Weifan, Shu Qiaojun, Wang Yiqiao

An acyclic edge coloring of a graph $G$ is a proper edge coloring such that no bichromatic cycles are produced. The acyclic chromatic index $a^{'} (G)$ of $G$ is the smallest integer $…

math.CO2012

A new upper bound on the acyclic chromatic indices of planar graphs

Weifan Wang, Qiaojun Shu, Yiqiao Wang

An acyclic edge coloring of a graph $G$ is a proper edge coloring such that no bichromatic cycles are produced. The acyclic chromatic index $a^{'} (G)$ of $G$ is the smallest integer $…

Degeneracy bounds, stability, and a sharp gap for B-colorings

1-Planar graphs without 6-cycles are 6-choosable

Feedback-arc robustness in random orientations of pseudorandom triangle-free graphs

D-coloring of planar graphs

The strong chromatic index of 1-planar graphs

On critical graphs for the chromatic edge-stability number

The saturation number of C6​

Every 4-regular graph is acyclically edge-6-colorable

A new upper bound on the acyclic chromatic indices of planar graphs

Degeneracy bounds, stability, and a sharp gap for $B$ -colorings

The saturation number of $C_{6}$