default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDQinghou Zeng
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2024
[j14]Jianfeng Hou, Caihong Yang
, Qinghou Zeng:
Counting triangles in graphs without vertex disjoint odd cycles. Discret. Math. 347(7): 114015 (2024)- [j13]Jinghua Deng, Jianfeng Hou, Qinghou Zeng:
The Turán number of three disjoint paths. Discuss. Math. Graph Theory 44(4): 1513-1537 (2024) - 2023
- [j12]Gaoxing Sun, Jianfeng Hou, Qinghou Zeng:
Large induced subgraphs with three repeated degrees. Discret. Math. 346(5): 113344 (2023) - 2022
- [j11]Jing Lin, Qinghou Zeng:
Maximum bipartite subgraphs in graphs without short cycles. Discret. Appl. Math. 311: 18-25 (2022) - [j10]Mengjiao Rao, Jianfeng Hou, Qinghou Zeng:
Maximum bisections of graphs without cycles of length 4. Discret. Math. 345(8): 112914 (2022) - [j9]Mengjiao Rao, Jianfeng Hou, Qinghou Zeng:
Odd Induced Subgraphs in Planar Graphs with Large Girth. Graphs Comb. 38(4): 105 (2022) - 2021
- [j8]Qinghou Zeng, Chunlei Zu:
A Generalization of Stiebitz-Type Results on Graph Decomposition. Electron. J. Comb. 28(2): 2 (2021) - [j7]Jing Lin, Qinghou Zeng:
Maximum bisections of graphs without short even cycles. J. Comb. Theory A 180: 105404 (2021) - 2020
- [j6]Jianfeng Hou, Shufei Wu, Qinghou Zeng, Wenxing Zhu:
Erratum: The Bollobás-Scott Conjecture for 4-Uniform Hypergraphs. SIAM J. Discret. Math. 34(4): 2583-2584 (2020) - 2018
- [j5]Qinghou Zeng, Jianfeng Hou:
Maximum cuts of graphs with forbidden cycles. Ars Math. Contemp. 15(1): 147-160 (2018) - [j4]Jianfeng Hou, Shufei Wu, Qinghou Zeng, Wenxing Zhu:
The Bollobás-Scott Conjecture for 4-Uniform Hypergraphs. SIAM J. Discret. Math. 32(1): 505-521 (2018) - 2017
- [j3]Jianfeng Hou, Qinghou Zeng:
Judicious Partitioning of Hypergraphs with Edges of Size at Most 2. Comb. Probab. Comput. 26(2): 267-284 (2017) - [j2]Jianfeng Hou, Qinghou Zeng:
On a Problem of Judicious k-Partitions of Graphs. J. Graph Theory 85(3): 619-643 (2017) - 2014
- [j1]Genghua Fan, Jianfeng Hou, Qinghou Zeng:
A bound for judicious k-partitions of graphs. Discret. Appl. Math. 179: 86-99 (2014)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-27 23:00 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
