Shenwei Huang

collaborators

3 papers

math.CO2026

Subcubic graphs without eigenvalues in $(- 1, 1)$

Shenwei Huang, Zilin Jiang

Guo and Royle recently classified the connected cubic graphs without eigenvalues of their adjacency matrix in the open interval $(- 1, 1)$ , and raised the question of extending thei…

math.CO2025

Three-coloring triangle-free graphs without long forbidden paths

Yidong Zhou, Jorik Jooken, Baoyuan Shan +2

A graph $G$ is $k$ -vertex-critical if $I ¨ (G) = k$ , but $I ¨ (G^{'}) < k$ for every proper induced subgraph $G^{'}$ of $G$ . For a family of graphs $F$ , $G$ is $F$ -free if no…

math.CO2025

There are finitely many $5$ -vertex-critical $(P_{6}, bull)$ -free graphs

Yiao Ju, Jorik Jooken, Jan Goedgebeur +1

In this paper, we are interested in $4$ -colouring algorithms for graphs that do not contain an induced path on $6$ vertices nor an induced bull, i.e., the graph with vertex set $\{…

Subcubic graphs without eigenvalues in (−1,1)

Three-coloring triangle-free graphs without long forbidden paths

There are finitely many 5-vertex-critical (P6​,bull)-free graphs

Subcubic graphs without eigenvalues in $(- 1, 1)$

There are finitely many $5$ -vertex-critical $(P_{6}, bull)$ -free graphs