Qinghou Zeng

According to our database, Qinghou Zeng authored at least 12 papers between 2014 and 2023.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of three.

2023

Large induced subgraphs with three repeated degrees.

Gaoxing Sun, Jianfeng Hou, Qinghou Zeng

Discret. Math., May, 2023

2022

Odd Induced Subgraphs in Planar Graphs with Large Girth.

Mengjiao Rao, Jianfeng Hou, Qinghou Zeng

Graphs Comb., 2022

Maximum bisections of graphs without cycles of length 4.

Mengjiao Rao, Jianfeng Hou, Qinghou Zeng

Discret. Math., 2022

Maximum bipartite subgraphs in graphs without short cycles.

Jing Lin, Qinghou Zeng

Discret. Appl. Math., 2022

2021

Maximum bisections of graphs without short even cycles.

Jing Lin, Qinghou Zeng

J. Comb. Theory, Ser. A, 2021

A Generalization of Stiebitz-Type Results on Graph Decomposition.

Qinghou Zeng, Chunlei Zu

Electron. J. Comb., 2021

2020

Erratum: The Bollobás-Scott Conjecture for 4-Uniform Hypergraphs.

Jianfeng Hou, Shufei Wu, Qinghou Zeng, Wenxing Zhu

SIAM J. Discret. Math., 2020

2018

The Bollobás-Scott Conjecture for 4-Uniform Hypergraphs.

Jianfeng Hou, Shufei Wu, Qinghou Zeng, Wenxing Zhu

SIAM J. Discret. Math., 2018

Maximum cuts of graphs with forbidden cycles.

Qinghou Zeng, Jianfeng Hou

Ars Math. Contemp., 2018

2017

On a Problem of Judicious <i>k</i>-Partitions of Graphs.

Jianfeng Hou, Qinghou Zeng

J. Graph Theory, 2017

Judicious Partitioning of Hypergraphs with Edges of Size at Most 2.

Jianfeng Hou, Qinghou Zeng

Comb. Probab. Comput., 2017

2014

A bound for judicious k-partitions of graphs.

Genghua Fan, Jianfeng Hou, Qinghou Zeng

Discret. Appl. Math., 2014