6 papers
On spectral conditions for fractional -extendable graphs
Xiyan Bai, Tao Wang, Mengke Yang +1
A fractional matching of a graph is a function such that for every vertex , where is the set of edges…
Decomposition of toroidal graphs without some subgraphs
Tao Wang, Xiaojing Yang
We consider a family of toroidal graphs, denoted by , which contain neither -cycles nor -cycles. A graph is -decomposable if it contains a sub…
Planar graphs without 4-, 7-, 9-cycles and 5-cycles normally adjacent to 3-cycles
Zhengjiao Liu, Tao Wang, Xiaojing Yang
A graph is \emph{-partitionable} if its vertex set can be partitioned into two parts such that one part is an independent set, and the oth…
Planar graphs with distance of 3-cycles at least 2 and no cycles of lengths 5, 6, 7
Tao Wang, Ya-Nan Wang, Xiaojing Yang
Weak degeneracy of a graph is a variation of degeneracy that has a close relationship to many graph coloring parameters. In this article, we prove that planar graphs with distance…
Claw-free cubic graphs are (1, 1, 1, 3)-packing edge-colorable
Jingxi Hou, Tao Wang, Xiaojing Yang
For a non-decreasing positive integer sequence , an -packing edge-coloring of a graph is a partition of the edge set of into subsets $E_{1}, \…
Planar graphs without -cycles at distance less than are -colorable
Zhen He, Tao Wang, Xiaojing Yang
A graph is -colorable if its vertex set can be partitioned into two subsets, one of which is an independent set, and the other induces a forest. In this…