Yiqiao Wang

collaborators

3 papers

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 $I^\pm (D)$ be the maximum order of an induced acyclic subdigraph, $I ¨ (D)$ its dichromatic number, and $fas (D)$ the minimum number of ar…

math.CO2025

The strong chromatic index of 1-planar graphs

Yiqiao Wang, Ning Song, Jianfeng Wang +1

The chromatic index $I ¨ ^{'} (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 chromati…