1 citations · 2 across the 13 of their papers we have counts for
21 papers
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…
A note on -free graphs and -free graphs
Wenjian Jia, Shuai Kou, Chengfu Qin +1
Let and be the planar and non-planar graphs that obtained from the Octahedron by 3-splitting a vertex respectively. For , we prove that a 4…
On traceable iterated line graph and hamiltonian path index
Zhaohong Nou, Liming Xiong, Weihua Yang
Xiong and Liu [L. Xiong and Z. Liu, Hamiltonian iterated line graphs, Discrete Math. 256 (2002) 407-422] gave a characterization of the graphs for which the -th iterated lin…