4 papers
An improved upper bound for the planar Turán number of
Xuqing Bai, Weichan Liu, Xiangxiang Nie +1
We prove that every -vertex simple planar graph with no copy of has at most \[ \frac{69}{25}(n-2) \] edges, for every . This improves the best known bound \[ \frac…
Planar Turán numbers of three configurations
Xuqing Bai, Zhipeng Gao, Ping Li
The planar Tuán number of , denoted by , is defined as the maximum number of edges in an -vertex -free planar graph. The exact value of $ex_{\mathc…
Cooperative colorings of hypergraphs
Xuqing Bai, Bi Li, Weichan Liu +1
Given a class of hypergraphs with the same vertex set , a cooperative coloring of them is a partition …
On independent domination and packing numbers of subcubic graphs
Xuqing Bai, Zhipeng Gao, Changqing Xi +1
In a recent paper, Cho and Kim proved that in subcubic graphs, the independent domination number is at most three times the packing number. They subsequently posed the question of…