3 citations · 17 across the 31 of their papers we have counts for
7 papers · 1 filter
Contractible Subgraphs of Contraction Critically Quasi -Connected Graphs
Shuai Kou, Chengfu Qin, Weihua Yang
Let be a contraction critically quasi -connected graph on at least vertices. If there is a vertex such that or $G[N_{G}(x)]\c…
The minimum degree of minimally -tough graphs
Xiaomin Hu, Hui Ma, Weihua Yang
A graph is minimally -tough if the toughness of is and deletion of any edge from decreases its toughness. Katona et al. conjectured that the minimum de…
An excluded minor theorem for the Wagner graph plus an edge
Yuqi Xu, Weihua Yang
Let denote the unique graph obtained from the Wagner graph, also known as , by adding an edge between two vertices of distance 3 on the Hamilton cycle, which is ex…
Counterexamples to Gerbner's Conjecture on Stability of Maximal -free Graphs
Jian Wang, Shipeng Wang, Weihua Yang
Let be an -color critical graph with , that is, and there is an edge in such that . Gerbner recently conjectured that every -ver…
A -decomposition of the -fold line graph of
Yifan Zhao, Yulong Wei, Weihua Yang
The small cycle decompositions of line graph (-fold line graph) of complete graphs and complete bipartite graphs are studied by many papers. In particular, Colby and Rodger obta…
Planar graphs without cycles of length from 4 to 7 are near-bipartite
Lili Hao, Weihua Yang, Shuang Zhao
A graph is near-bipartite if its vertex set can be partitioned into an independent set and a set which induces a forest. In this paper, planar graphs without cycles of length from…
On the regular 2-connected 2-path Hamiltonian graphs
Xia Li, Weihua Yang
A graph is -path Hamiltonian if every path of length not exceeding is contained in a Hamiltonian cycle. It is well known that a 2-connected, -regular graph on at…