Huan Zhou

activity

20232026

most citedArc weighted acyclic orientations and variations of degeneracy of graphs

1 citations · 1 across the 9 of their papers we have counts for

collaborators

10 papers

math.CO2026

Tighter Bounds on the Degree-Truncated Choice Number of Planar Graphs

Huijuan Xu, Huan Zhou, Jialu Zhu +1

Assume $G$ is a graph and $k$ is a positive integer. Let $f : V (G) \to N$ be defined as $f (v) = min {k, d_{G} (v)}$ . If $G$ is $f$ -choosable, then we say $G$ is degree-truncated…

math.CO2025

Extension of the Gyárfás-Sumner conjecture to signed graphs

Guillaume Aubian, Allen Ibiapina, Luis Kuffner +4

The balanced chromatic number of a signed graph G is the minimum number of balanced sets that cover all vertices of G. Studying structural conditions which imply bounds on the bala…

math.CO2025

Brooks' theorem for signed graphs with $Δ = 3$

Reza Naserasr, Huan Zhou

Circular $r$ -coloring of a signed graph $(G, σ)$ is a mapping of its vertices to a circle of circumference $r$ such that: I. each pair of vertices with a negative connection is at d…

math.CO2025

Degree-truncated choosability of graphs

Huan Zhou, Jialu Zhu, Xuding Zhu

A graph $G$ is called degree-truncated $k$ -choosable if for every list assignment $L$ with $∣ L (v) ∣ \geq min {d_{G} (v), k}$ for each vertex $v$ , $G$ is $L$ -colourable. Richter asked…

math.CO2025

Fractional balanced chromatic number and arboricity of planar (signed) graphs

Reza Naserasr, Lan Anh Pham, Cyril Pujol +1

A fractional coloring of a signed graph $(G, σ)$ is an assignment of nonnegative weights to the balanced sets (sets which do not induce a negative cycle) such that each vertex has…

math.CO2025

Indicated list colouring game on graphs

Yangyan Gu, Yiting Jiang, Huan Zhou +2

Given a graph $G$ and a list assignment $L$ for $G$ , the indicated $L$ -colouring game on $G$ is played by two players: Ann and Ben. In each round, Ann chooses an uncoloured vertex…

math.CO2024

Colouring signed analogues of Kneser, Schrijver, and Borsuk graphs

Luis Kuffner, Reza Naserasr, Lujia Wang +3

The Kneser signed graph $\KS(n,k)$, $k \leq n$ , is the graph whose vertices are signed $k$ -subsets of $[n]$ (i.e. $k$ -subsets $S$ of ${\pm 1, \pm 2, \dots, \pm n}$ such that $S\…

math.CO2023

Truncated degree DP-colourability of $K_{2, 4}$ -minor free graphs

On-Hei Solomon Lo, Cheng Wang, Huan Zhou +1

Assume $G$ is a graph and $k$ is a positive integer. Let $f$ from $V (G)$ to $N$ be defined as $f (v)$ is the minimum of $k$ and $d (v)$ . If $G$ is $f$ -DP-colourable (respectively, $…

math.CO2023★ 1 cited

Arc weighted acyclic orientations and variations of degeneracy of graphs

Huan Zhou, Jialu Zhu, Xuding Zhu

This paper studies generalizations of the concept of acyclic orientations to arc-weighted orientations. These lead to four types of variations of strict degeneracy of graphs. Some…

math.CO2023

Weak degeneracy of planar graphs and locally planar graphs

Ming Han, Tao Wang, Jianglin Wu +2

Weak degeneracy is a variation of degeneracy which shares many nice properties of degeneracy. In particular, if a graph $G$ is weakly $d$ -degenerate, then for any $(d + 1)$ -list as…

Tighter Bounds on the Degree-Truncated Choice Number of Planar Graphs

Extension of the Gyárfás-Sumner conjecture to signed graphs

Brooks' theorem for signed graphs with Δ=3

Degree-truncated choosability of graphs

Fractional balanced chromatic number and arboricity of planar (signed) graphs

Indicated list colouring game on graphs

Colouring signed analogues of Kneser, Schrijver, and Borsuk graphs

Truncated degree DP-colourability of K2,4​-minor free graphs

Arc weighted acyclic orientations and variations of degeneracy of graphs

Weak degeneracy of planar graphs and locally planar graphs

Brooks' theorem for signed graphs with $Δ = 3$

Truncated degree DP-colourability of $K_{2, 4}$ -minor free graphs