Searcharxiv⌕ Search

arXiv subjects

Zhou Guofei

Publications and source records attributed to Zhou Guofei.

5 recordsLinked to original sources

Independent Sets in $C_4$-Free Planar Graphs: Sharp Claw-Free Bounds and Structural Reductions

For every claw-free $C_4$-free planar graph, we prove the sharp weighted bound $α_w(G)\ge (10/31)\sum_v w(v)$, equivalently $χ_f(G)\le31/10$. The proof uses a line-graph representation and the matching polytope; the exceptional small roots are excluded analytically by planar duality and degree-four neighborhood analysis in triangulations. We also prove that, in every $2$-connected $C_4$-free graph of minimum degree at least four, an independent selection of claw centers leaves a compatible subgraph of noncenters with fractional chromatic number at most three; planarity is not required. We apply these results to the conjecture $α(G)\ge5|V(G)|/16$. A minimum-order counterexample without degree-three vertices has at least forty-nine vertices. When all degree-three components of a minimum counterexample are triangle trees, we derive exact boundary states and a joint matching formula. We identify the remaining deficiency estimate and the additional component types that must be addressed to extend this approach. The general conjecture remains open.

math.CO↗

From Diagonal Coloring to Proper Vertex Labelings Distinguishing Adjacent Facial Sums

In this paper we study proper vertex labelings of 3-connected plane graphs that give distinct boundary-vertex sums to faces sharing an edge. Let $λ(G)$ be the least $k$ for which labels from $\{0,\ldots,k\}$ suffice, and let $\laml(G)$ be its arbitrary-real-list counterpart. Our two main results are an eight-element list theorem for fullerenes and the universal bound $λ(G)\le708587$ for all 3-connected plane graphs. We establish structural nine- and eight-color bounds, classify triangulations whose vertices of degree at least five form an independent set, and determine their exact diagonal chromatic numbers. We also prove closure under triangular sums for $q\ge7$ diagonal colors, with an optimal uniform threshold. For cubic 3-connected plane graphs we obtain $λ\le14$, improving to $λ\le9$ in the bipartite case.

math.CO↗

Constructing a Family of 4-Critical Planar Graphs with High Edge-Density

A graph $G=(V,E)$ is a $k$-critical graph if $G$ is not $(k -1)$-colorable but $G-e$ is $(k-1)$-colorable for every $e\in E(G)$. In this paper, we construct a family of 4-critical planar graphs with $n$ vertices and $\frac{7n-13}{3}$ edges. As a consequence, this improved the bound for the maximum edge density obtained by Abbott and Zhou. We conjecture that this is the largest edge density for a 4-critical planar graph.

math.CO↗

Planar Ramsey Numbers of Four Cycles Versus Wheels

For two given graphs $G$ and $H$ the planar Ramsey number $PR(G,H)$ is the smallest integer $n$ such that every planar graph $F$ on $n$ vertices either contains a copy of $G$, or its complement contains a copy of $H$. In this paper, we first characterize some structural properties of $C_4$-free planar graphs, and then we determine all planar Ramsey numbers $PR(C_4, W_n)$, for $n\ge 3$.

math.CO↗