Gexin Yu

Ore-condition and Z3-connectivity

Let G be a simple graph satisfying the Ore-condition with |V(G)|>=3. In this paper, we prove that G is A-connected for any abelian group A with |A|>=3 if and only if G is not one of the 12 completely described graphs.

On Sufficient Degree Conditions for a Graph to be

A graph is

k

k

-linked

-linked if for every list of

Injective Colorings of Graphs with Low Average Degree

2k

On Minimum Degree Implying That a Graph is H-Linked

vertices

Decomposing a planar graph with girth 9 into a forest and a matching

\{s_1,{\ldots}\,s_k, t_1,{\ldots}\,t_k\}

An extremal problem forH-linked graphs

, there exist internally disjoint paths

A Relaxation of Steinberg's Conjecture

P_1,{\ldots}\, P_k

An extremal problem on group connectivity of graphs

such that each