Qinghou Zeng

Publication Activity (10 Years)

Years Active: 2014-2024
Publications (10 Years): 13

Top Topics

Reachability Queries

Top Venues

Discret. Appl. Math.

SIAM J. Discret. Math.

Comb. Probab. Comput.

Publications

Jinghua Deng, Jianfeng Hou, Qinghou Zeng
The Turán number of three disjoint paths. Discuss. Math. Graph Theory 44 (4) (2024)
Jianfeng Hou, Caihong Yang, Qinghou Zeng
Counting triangles in graphs without vertex disjoint odd cycles. Discret. Math. 347 (7) (2024)
Gaoxing Sun, Jianfeng Hou, Qinghou Zeng
Large induced subgraphs with three repeated degrees. Discret. Math. 346 (5) (2023)
Mengjiao Rao, Jianfeng Hou, Qinghou Zeng
Maximum bisections of graphs without cycles of length 4. Discret. Math. 345 (8) (2022)
Jing Lin, Qinghou Zeng
Maximum bipartite subgraphs in graphs without short cycles. Discret. Appl. Math. 311 (2022)
Mengjiao Rao, Jianfeng Hou, Qinghou Zeng
Odd Induced Subgraphs in Planar Graphs with Large Girth. Graphs Comb. 38 (4) (2022)
Jing Lin, Qinghou Zeng
Maximum bisections of graphs without short even cycles. J. Comb. Theory, Ser. A 180 (2021)
Qinghou Zeng, Chunlei Zu
A Generalization of Stiebitz-Type Results on Graph Decomposition. Electron. J. Comb. 28 (2) (2021)
Jianfeng Hou, Shufei Wu, Qinghou Zeng, Wenxing Zhu
Erratum: The Bollobás-Scott Conjecture for 4-Uniform Hypergraphs. SIAM J. Discret. Math. 34 (4) (2020)
Qinghou Zeng, Jianfeng Hou
Maximum cuts of graphs with forbidden cycles. Ars Math. Contemp. 15 (1) (2018)
Jianfeng Hou, Shufei Wu, Qinghou Zeng, Wenxing Zhu
The Bollobás-Scott Conjecture for 4-Uniform Hypergraphs. SIAM J. Discret. Math. 32 (1) (2018)
Jianfeng Hou, Qinghou Zeng
-Partitions of Graphs. J. Graph Theory 85 (3) (2017)
Jianfeng Hou, Qinghou Zeng
Judicious Partitioning of Hypergraphs with Edges of Size at Most 2. Comb. Probab. Comput. 26 (2) (2017)
Genghua Fan, Jianfeng Hou, Qinghou Zeng
A bound for judicious k-partitions of graphs. Discret. Appl. Math. 179 (2014)