3 papers
math.CO2025
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…
math.CO2025
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…
math.CO2025
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…