331 citations
- University of Chinese Academy of SciencesCN253 papers
- Tsinghua UniversityCN243 papers
- University of ManchesterGB241 papers
- University of OxfordGB240 papers
- Istituto Nazionale di Fisica Nucleare, Laboratori Nazionali di FrascatiIT239 papers
- Uppsala UniversitySE238 papers
- Zhengzhou UniversityCN217 papers
- Peking UniversityCN213 papers
- Nanjing UniversityCN209 papers
- University of Science and Technology of ChinaCN208 papers
- Shandong UniversityCN205 papers
- Shanghai Jiao Tong UniversityCN203 papers
29 papers · 1 filter
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…
Variable degeneracy of planar graphs without chorded 6-cycles
Huihui Fang, Danjun Huang, Tao Wang +1
A cover of a graph is a graph with vertex set , where , and the edge set , wh…
Toroidal graphs without and 6-cycles
Ping Chen, Tao Wang
Cai et al.\ proved that a toroidal graph without -cycles is -choosable, and proposed the conjecture that if and only if contains a [J. Gr…
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}, \…