15 citations · 77 across the 40 of their papers we have counts for
41 papers
Cliques in Squares of Graphs with Maximum Average Degree less than 4
Daniel W. Cranston, Gexin Yu
Hocquard, Kim, and Pierron constructed, for every even integer , a 2-degenerate graph with maximum degree such that . We prove for (a) all 2-de…
A sufficient condition for a hypergraph to have a Berge--factor
Yuping Gao, Songling Shan, Gexin Yu
For any graph (hypergraph) with vertex set and edge set , we define its incidence bipartite graph as the bipartite graph with bipartition , wher…
Strong edge-coloring of 2-degenerate graphs
Gexin Yu, Rachel Yu
A strong edge-coloring of a graph is an edge-coloring in which every color class is an induced matching, and the strong chromatic index is the minimum number of color…
Spanning tree packing and 2-essential edge-connectivity
Xiaofeng Gu, Runrun Liu, Gexin Yu
An edge (vertex) cut of is -essential if has two components each of which has at least edges. A graph is -essentially -edge-connected (resp. -conn…
1-planar graphs are odd 13-colorable
Runrun Liu, Weifan Wang, Gexin Yu
An odd coloring of a graph is a proper coloring such that any non-isolated vertex in has a coloring appears odd times on its neighbors. The odd chromatic number, denoted by…
Sufficient conditions for 2-dimensional global rigidity
Xiaofeng Gu, Wei Meng, Martin Rolek +2
The 2-dimensional global rigidity has been shown to be equivalent to 3-connectedness and redundant rigidity by a combination of two results due to Jackson and Jordán, and Connelly,…