13 citations · 17 across the 7 of their papers we have counts for
5 papers · 1 filter
Strong chromatic index of bipartite graphs
Yanli Hao, Tianchi Yang, Xingxing Yu
An edge-coloring of a graph is called a strong edge-coloring if all its color classes are induced matchings in ; the minimum number of colors required for such a coloring, d…
Upper bounds on the extremal number of the 4-cycle
Jie Ma, Tianchi Yang
We obtain some new upper bounds on the maximum number of edges in -vertex graphs without containing cycles of length four. This leads to an asymptotically optimal bound o…
Non-repeated cycle lengths and Sidon sequences
Jie Ma, Tianchi Yang
We prove a conjecture of Boros, Caro, Füredi and Yuster on the maximum number of edges in a 2-connected graph without repeated cycle lengths, which is a restricted version of a lon…
Counting critical subgraphs in -critical graphs
Jie Ma, Tianchi Yang
Gallai asked in 1984 if any -critical graph on vertices contains at least distinct -critical subgraphs. The answer is trivial for . Improving a result of…
Decomposing -free graphs under degree constraints
Jie Ma, Tianchi Yang
A celebrated theorem of Stiebitz asserts that any graph with minimum degree at least can be partitioned into two parts which induce two subgraphs with minimum degree at lea…