66 citations · 268 across the 69 of their papers we have counts for
73 papers
Bounds on Odd and Odd-Even Induced Subgraphs
Qiwen Guo, Gregory Gutin, Yiming Hao +3
Let be an -vertex graph and let prescribe degree parities. A set is -admissible if every has degree congruent to…
A quadratic refinement of Jackson's \CE\ condition for Hamilton cycles in digraphs
Jiangdong Ai, Yongtang Shi
For a digraph , let be the largest size of a vertex set no two of whose vertices lie in a common directed -cycle. Let be the least integer such that eve…
Maximal independent sets in graphs with given matching number
Yongtang Shi, Jianhua Tu, Ziyuan Wang
A maximal independent set in a graph is an independent set that cannot be extended to a larger independent set by adding any vertex from . This paper investigates the proble…
Extremal spectral results of planar graphs without vertex-disjoint cycles
Longfei Fang, Huiqiu Lin, Yongtang Shi
Given a planar graph family , let and be the maximum size and maximum spectral radius…
Planar Turán numbers of cubic graphs and disjoint union of cycles
Yongxin Lan, Yongtang Shi, Zi-Xia Song
The planar Turán number of a graph , denoted , is the maximum number of edges in a planar graph on vertices without containing as a subgraph. Thi…
Counting rainbow triangles in edge-colored graphs
Xueliang Li, Bo Ning, Yongtang Shi +1
Let be an edge-colored graph on vertices. The minimum color degree of , denoted by , is defined as the minimum number of colors assigned to the edges incident to…