3 papers
math.CO2026
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…
math.CO2025
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}, \…
math.CO2025
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…