11 citations · 13 across the 9 of their papers we have counts for
9 papers
Multicolor Ramsey and list Ramsey numbers for star-like trees
Qinghong Zhao, Yaping Mao, Xiangqian Zhou
For a graph \(H\), the \(k\)-color Ramsey number \(r(H;k)\) is the least integer \(N\) such that every \(k\)-edge-coloring of \(K_N\) contains a monochromatic copy of \(H\). A \(k\…
Ramsey Achievement Games on Graphs : Algorithms and Bounds
Xiumin Wang, Zhong Huang, Xiangqian Zhou +2
In 1982, Harary introduced the concept of Ramsey achievement game on graphs. Given a graph with no isolated vertices. Consider the following game played on the complete graph $…
Some novel minimax results for perfect matchings of hexagonal systems
Xiangqian Zhou, Heping Zhang
The anti-forcing number of a perfect matching of a graph is the minimum number of edges of whose deletion results in a subgraph with a unique perfect matching , deno…
Forcing and anti-forcing polynomials of perfect matchings of a pyrene system
Kai Deng, Saihua Liu, Xiangqian Zhou
The forcing number of a perfect matching of a graph was introduced by Harary et al., which originated from Klein and Randić's ideal of innate degree of freedom of Kekulé structure…
DP-4-colorability of two classes of planar graphs
Lily Chen, Runrun Liu, Gexin Yu +2
DP-coloring (also known as correspondence coloring) is a generalization of list coloring introduced recently by Dvořák and Postle (2017). In this paper, we prove that every planar…
The strong chromatic index of -bipartite graphs
Mingfang Huang, Gexin Yu, Xiangqian Zhou
A strong edge-coloring of a graph is a partition of its edge set into induced matchings. We study bipartite graphs with one part having maximum degree at most and…
Triangle-roundedness in matroids
João Paulo Costalonga, Xianqiang Zhou
A matroid is said to be triangle-rounded in a class of matroids if each -connected matroid with a triangle and an -minor has an -m…
Tars: Timeliness-aware Adaptive Replica Selection for Key-Value Stores
Wanchun Jiang, Liyuan Fang, Haiming Xie +2
In current large-scale distributed key-value stores, a single end-user request may lead to key-value access across tens or hundreds of servers. The tail latency of these key-value…
A Maximum Resonant Set of Polyomino Graphs
Heping Zhang, Xiangqian Zhou
A polyomino graph is a connected finite subgraph of the infinite plane grid such that each finite face is surrounded by a regular square of side length one and each edge belong…