4 citations · 4 across the 4 of their papers we have counts for
4 papers
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 -degenerate if each of its subgraphs contains a vertex of…
Feedback-arc robustness in random orientations of pseudorandom triangle-free graphs
Hui Lei, Danning Wang, Yiqiao Wang
For an oriented graph , let be the maximum order of an induced acyclic subdigraph, its dichromatic number, and the minimum number of arcs…
D-coloring of planar graphs
Xiaoxue Hu, Jiangxu Kong, Yiqiao Wang
A proper edge-coloring of a graph is a D-coloring if every subgraph isomorphic to is rainbow. The minimum number of colors in such a coloring is the D-chromatic index $…
Every 4-regular graph is acyclically edge-6-colorable
Wang Weifan, Shu Qiaojun, Wang Yiqiao
An acyclic edge coloring of a graph is a proper edge coloring such that no bichromatic cycles are produced. The acyclic chromatic index of is the smallest integer $…