6 citations · 16 across the 8 of their papers we have counts for
8 papers
Balanced even cycles in signed graphs:Turán bounds, double covers, and parity obstructions
Lujia Wang, Xiaowei Yu
We study Turán problems for balanced even cycles in simple signed graphs, where signed subgraphs are considered up to switching. For every balanced bipartite signed graph, the sign…
Fractional balanced chromatic number of signed subcubic graphs
Xiaolan Hu, Luis Kuffner, Jiaao Li +4
A signed graph is a pair , where is a graph and , called signature, is an assignment of signs to the edges. Given a signed graph wit…
Colouring signed analogues of Kneser, Schrijver, and Borsuk graphs
Luis Kuffner, Reza Naserasr, Lujia Wang +3
The Kneser signed graph $\KS(n,k)$, , is the graph whose vertices are signed -subsets of (i.e. -subsets of such that $S\…
Antimagic Orientation of Forests
Songling Shan, Xiaowei Yu
An antimagic labeling of a digraph with vertices and arcs is a bijection from the set of arcs of to such that all oriented vertex-sums are pa…
List star edge coloring of generalized Halin graphs
Zhengke Miao, Yimin Song, Tao Wang +1
A star -edge coloring is a proper edge coloring such that there are no bichromatic paths or cycles of length four. The smallest integer such that admits a star -edge…
Improved bounds on the Ramsey number of fans
Guantao Chen, Xiaowei Yu, Yi Zhao
For a given graph , the Ramsey number is the minimum such that any 2-edge-coloring of the complete graph yields a monochromatic copy of . Given a positive in…
Planar graphs without 4-cycles adjacent to triangles are DP-4-colorable
Seog-Jin Kim, Xiaowei Yu
DP-coloring (also known as correspondence coloring) of a simple graph is a generalization of list coloring. It is known that planar graphs without 4-cycles adjacent to triangles ar…
Antimagic orientation of biregular bipartite graphs
Songling Shan, Xiaowei Yu
An antimagic labeling of a directed graph with vertices and arcs is a bijection from the set of arcs of to the integers such that all oriente…