2 citations · 5 across the 4 of their papers we have counts for
7 papers
Flexibility of planar graphs without and
Donglei Yang, Fan Yang
Let be a -free planar graph with a list assignment . Suppose a preferred color is given for some of the vertices. We prove that if all lists have size at least…
Antimagic orientations of graphs with given independence number
Zi-Xia Song, Donglei Yang, Fangfang Zhang
Given a digraph with arcs and a bijection , we say is an antimagic orientation of a graph if is an orientation of $…
Antimagic orientations of graphs with large maximum degree
Donglei Yang, Joshua Carlson, Andrew Owens +5
Given a digraph with arcs, a bijection is an antimagic labeling of if no two vertices in have the same vertex-sum, where t…
A note on antimagic orientations of even regular graphs
Donglei Yang
Motivated by the conjecture of Hartsfield and Ringel on antimagic labelings of undirected graphs, Hefetz, Mütze, and Schwartz initiated the study of antimagic labelings of digraphs…
Strong list-chromatic index of subcubic graphs
Tianjiao Dai, Guanghui Wang, Donglei Yang +1
A strong -edge-coloring of a graph G is an edge-coloring with colors in which every color class is an induced matching. The strong chromatic index of , denoted by $χ'_{s}…
List strong edge-coloring of graphs with maximum degree 4
Baochen Zhang, Yulin Chang, Jie Hu +2
A strong edge-coloring of a graph is an edge-coloring such that any two edges on a path of length three receive distinct colors. We denote the strong chromatic index by $χ_{s}'…