Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDHong Wang 0005
Person information
- unicode name: 汪泓
- affiliation: University of Idaho, Department of Mathematics, Moscow, ID, USA
- affiliation (former): University of New Orleans, Department of Mathematics, LA, USA
- affiliation (former): University of Calgary, Department of Mathematics and Statistics, AB, Canada
Other persons with the same name
- Hong Wang — disambiguation page
- Hong Wang 0001
![[0000-0003-1069-9786]](https://dblp.uni-trier.de/img/orcid-mark.12x12.png "0000-0003-1069-9786")
— Oak Ridge National Laboratory, Oak Ridge, TN, USA (and 7 more) - Hong Wang 0002 — University of Connecticut, Department of Computer Science and Engineering
- Hong Wang 0003 — Intel Santa Clara, California
- Hong Wang 0004 — Tsinghua University
- Hong Wang 0006 — Tohoku University
- Hong Wang 0007 — University of Toledo, Ohio, USA
- Hong Wang 0008 — Nanyang Technological University, Singapore
- Hong Wang 0009 — Central South University, School of Mathematics and Statistics, Changsha, China (and 1 more)
- Hong Wang 0010 — Northeastern University, Department of Mechanical Engineering and Automation, Shenyang, China (and 1 more)
- Hong Wang 0011 — City University of Hong Kong, State Key Laboratory of Millimeter Waves, Hong Kong (and 1 more)
- Hong Wang 0012 — Nanjing Audit University, Institute for Social and Economic Research, China (and 1 more)
- Hong Wang 0013 — Agriculture and Agri-Food Canada, Saskatchewan, Canada
- Hong Wang 0014 — Tsinghua University, Tsinghua Intelligent Vehicle Design and Safety Research Institute, Beijing, China (and 2 more)
- Hong Wang 0015 — Shandong Normal University, School of Information Science and Engineering, Jinan, China
- Hong Wang 0016 — Hong Kong Polytechnic University, Department of Mechanical Engineering, Hong Kong (and 1 more)
- Hong Wang 0017 — Air Force Engineering University, Information and Navigation College, Xi'an, China (and 1 more)
- Hong Wang 0018 — University of South Carolina, Department of Mathematics, USA
- Hong Wang 0019 — Qilu Hospital of Shandong University, Jinan, China
- Hong Wang 0020 — University of Greenwich, London, UK
- Hong Wang 0021 — Tencent Jarvis Lab, Shenzhen, China (and 1 more)
- Hong Wang 0022 — Beijing Normal University, Faculty of Geographical Science, State Key Laboratory of Earth Surface Processes and Resource Ecology, China
- Hong Wang 0023 — University of California, Santa Barbara, CA, USA
- Hong Wang 0024 — Brookhaven National Laboratory, NY, USA (and 1 more)
- Hong Wang 0025 — Beijing Institute of Technology, Key Laboratory of Photoelectronic Imaging Technology and System, Ministry of Education, China (and 1 more)
- Hong Wang 0026 — Shanxi Normal University, School of Mathematics and Computer Science, China
- Hong Wang 0027 — Henan Key Laboratory of Network Cryptography Technology, State Key Laboratory of Mathematical Engineering and Advanced Computing, Zhengzhou, China
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j66]Hong Wang, Yun Wang, Jin Yan:
Disjoint Cycles in a Digraph with Partial Degree. SIAM J. Discret. Math. 37(1): 221-232 (2023)- 2021
- [j65]Yunshu Gao, Hong Wang, Qingsong Zou:
Disjoint directed cycles with specified lengths in directed bipartite graphs. Discret. Math. 344(4): 112276 (2021) - 2020
- [j64]Hong Wang:
Disjoint directed cycles in directed graphs. Discret. Math. 343(8): 111927 (2020) - [j63]Hong Wang:
Disjoint cycles covering matchings in graphs with partial degrees. J. Graph Theory 93(3): 450-457 (2020)
2010 – 2019
- 2019
- [j62]Yunshu Gao, Xiaoyao Lin, Hong Wang:
Vertex-disjoint double chorded cycles in bipartite graphs. Discret. Math. 342(9): 2482-2492 (2019) - 2018
- [j61]Hong Wang:
Disjoint cycles of order at least 5. Australas. J Comb. 71: 54-67 (2018) - [j60]Hong Wang:
Covering a Graph with Cycles of Length at Least 4. Electron. J. Comb. 25(1): 1 (2018) - 2017
- [j59]Zhihui Jiao, Hong Wang, Jin Yan:
Disjoint cycles in graphs with distance degree sum conditions. Discret. Math. 340(6): 1203-1209 (2017) - 2016
- [j58]Hong Wang:
Covering a subset with two cycles. Australas. J Comb. 65: 27-36 (2016) - 2015
- [j57]Hong Wang:
Partial Degree Conditions and Cycle Coverings. J. Graph Theory 78(4): 295-304 (2015) - 2013
- [p1]Hong Wang, Norbert Sauer:
The Chromatic Number of the Two-Packing of a Forest. The Mathematics of Paul Erdős II 2013: 143-166 - 2012
- [j56]Hong Wang:
An extension of the Corrádi-Hajnal Theorem. Australas. J Comb. 54: 59-84 (2012) - [j55]Hong Wang:
Disjoint 5-cycles in a graph. Discuss. Math. Graph Theory 32(2): 221-242 (2012) - 2010
- [j54]Ryan Bauer, Hong Wang:
Disjoint triangles and pentagons in a graph. Australas. J Comb. 46: 79-90 (2010) - [j53]Hong Wang:
Proof of the Erdos-Faudree Conjecture on Quadrilaterals. Graphs Comb. 26(6): 833-877 (2010)
2000 – 2009
- 2009
- [j52]Hong Wang:
Packing two copies of a sparse graph into a graph with restrained maximum degree. J. Graph Theory 62(2): 178-187 (2009) - 2007
- [j51]Hong Wang:
Pentagons and cycle coverings. J. Graph Theory 54(3): 194-208 (2007) - 2005
- [j50]Hong Wang:
On large cycles with lengths differing by one or two. Australas. J Comb. 33: 329-334 (2005) - [j49]Hong Wang:
Maximal Total Length Of k Disjoint Cycles In Bipartite Graphs. Comb. 25(3): 367-377 (2005) - [j48]Yoshimi Egawa, Shinya Fujita, Ken-ichi Kawarabayashi, Hong Wang:
Existence of two disjoint long cycles in graphs. Discret. Math. 305(1-3): 154-169 (2005) - [j47]Danhong Zhang, Hong Wang:
Disjoint directed quadrilaterals in a directed graph. J. Graph Theory 50(2): 91-104 (2005) - 2004
- [j46]Danhong Zhang, Hong Wang:
A minimum degree result for disjoint cycles and forests in bipartite graphs. Australas. J Comb. 29: 35-48 (2004) - [j45]Hong Wang:
Vertex-disjoint quadrilaterals in graphs. Discret. Math. 288(1-3): 149-166 (2004) - 2003
- [j44]Yoshimi Egawa, Mariko Hagita, Ken-ichi Kawarabayashi, Hong Wang:
Covering vertices of a graph by k disjoint cycles. Discret. Math. 270(1-3): 114-124 (2003) - 2002
- [j43]Yoshiyasu Ishigami, Hong Wang:
An extension of a theorem on cycles containing specified independent edges. Discret. Math. 245(1-3): 127-137 (2002) - 2001
- [j42]Hong Wang:
On Quadrilaterals and Cycle Covers in a Bipartite Graph. Ars Comb. 58 (2001) - [j41]Hong Wang:
Directed Bipartite Graphs Containing Every Possible Pair of Directed Cycles. Ars Comb. 60 (2001) - [j40]Hong Wang:
On Independent Cycles in a Bipartite Graph. Graphs Comb. 17(1): 177-183 (2001) - [j39]Hong Wang:
On Covering a Bipartite Graph with Cycles. SIAM J. Discret. Math. 15(1): 86-96 (2001) - 2000
- [j38]Hong Wang:
On the maximal number of vertices covered by disjoint cycles. Australas. J Comb. 21: 179-186 (2000) - [j37]Yoshimi Egawa, Ralph J. Faudree, Ervin Györi, Yoshiyasu Ishigami, Richard H. Schelp, Hong Wang:
Vertex-Disjoint Cycles Containing Specified Edges. Graphs Comb. 16(1): 81-92 (2000) - [j36]Hong Wang:
Large Vertex-Disjoint Cycles in a Bipartite Graph. Graphs Comb. 16(3): 359-366 (2000) - [j35]Hong Wang:
Independent Directed Triangles in a Directed Graph. Graphs Comb. 16(4): 453-462 (2000) - [j34]Hong Wang:
Digraphs containing every possible pair of dicycles. J. Graph Theory 34(2): 154-162 (2000)
1990 – 1999
- 1999
- [j33]Hong Wang:
Covering a bipartite graph with cycles passing through given edges. Australas. J Comb. 19: 115-122 (1999) - [j32]Bert Randerath, Ingo Schiermeyer, Hong Wang:
On quadrilaterals in a graph. Discret. Math. 203(1-3): 229-237 (1999) - [j31]Hong Wang:
On the maximum number of independent cycles in a graph. Discret. Math. 205(1-3): 183-190 (1999) - [j30]Hong Wang:
Bipartite graphs containing every possible pair of cycles. Discret. Math. 207(1-3): 233-242 (1999) - [j29]Hong Wang:
On Vertex-Disjoint Complete Bipartite Subgraphs in a Bipartite Graph. Graphs Comb. 15(3): 353-364 (1999) - [j28]Hong Wang:
On 2-factors of a bipartite graph. J. Graph Theory 31(2): 101-106 (1999) - [j27]Hong Wang:
Proof of a conjecture on cycles in a bipartite graph. J. Graph Theory 31(4): 333-343 (1999) - 1998
- [j26]David M. Berman, Jiannong Liu, Hong Wang, Larry Wargo:
Induced stars in trees. Australas. J Comb. 18: 275-276 (1998) - [j25]Hong Wang:
Vertex-Disjoint Triangles in Claw-Free Graphs with Minimum Degree at Least Three. Comb. 18(3): 441-447 (1998) - [j24]Hong Wang:
Vertex-disjoint hexagons with chords in a bipartite graph. Discret. Math. 187(1-3): 221-231 (1998) - [j23]Hong Wang:
Triangles in claw-free graphs. Discret. Math. 187(1-3): 233-244 (1998) - 1997
- [j22]David M. Berman, Hong Wang, Larry Wargo:
Odd induced subgraphs in graphs of maximum degree three. Australas. J Comb. 15: 81-86 (1997) - [j21]Hong Wang:
On vertex-disjoint complete subgraphs of a graph. Australas. J Comb. 16: 165-174 (1997) - [j20]Yee-Hock Peng, C. H. C. Little, Kee L. Teo, Hong Wang:
Chromatic equivalence classes of certain generalized polygon trees. Discret. Math. 172(1-3): 103-114 (1997) - [j19]David M. Berman, A. J. Radcliffe, Alex D. Scott, Hong Wang, Larry Wargo:
All trees contain a large induced subgraph having all degrees 1 (mod k). Discret. Math. 175(1-3): 35-40 (1997) - [j18]Charles H. C. Little, Kee L. Teo, Hong Wang:
On a Conjecture on Directed Cycles in a Directed Bipartite Graph. Graphs Comb. 13(3): 267-273 (1997) - [j17]Hong Wang:
Packing two bipartite graphs into a complete bipartite graph. J. Graph Theory 26(2): 95-104 (1997) - [j16]Hong Wang:
Covering a graph with cycles passing through given edges. J. Graph Theory 26(2): 105-109 (1997) - 1996
- [j15]Hong Wang, Charles H. C. Little, Kee L. Teo:
Partition of a directed bipartite graph into two directed cycles. Discret. Math. 160(1-3): 283-289 (1996) - [j14]Hong Wang:
On long cycles in a 2-connected bipartite graph. Graphs Comb. 12(1): 373-384 (1996) - [j13]Hong Wang:
On the Maximum Number of Independent Cycles in a Bipartite Graph. J. Comb. Theory B 67(1): 152-164 (1996) - [j12]Hong Wang, Norbert Sauer:
Packing of three copies of a graph. J. Graph Theory 21(1): 71-80 (1996) - [j11]Hong Wang:
Packing two forests into a bipartite graph. J. Graph Theory 23(2): 209-213 (1996) - 1995
- [j10]Charles H. C. Little, Hong Wang:
Vertex disjoint cycles in a directed graph. Australas. J Comb. 12: 113-120 (1995) - [j9]Hong Wang:
Two vertex-disjoint cycles in a graph. Graphs Comb. 11(4): 389-396 (1995) - [j8]Hong Wang:
Covering a graph with cycles. J. Graph Theory 20(2): 203-211 (1995) - 1994
- [j7]Hong Wang:
Packing a forest with a graph. Australas. J Comb. 10: 205-210 (1994) - [j6]Hong Wang:
On K1, k-factorizations of a complete bipartite graph. Discret. Math. 126(1-3): 359-364 (1994) - [j5]Hong Wang:
Independent cycles with limited size in a graph. Graphs Comb. 10(2-4): 271-281 (1994) - [j4]Hong Wang:
Path factors of bipartite graphs. J. Graph Theory 18(2): 161-167 (1994) - 1993
- [j3]Hong Wang:
Partition of a bipartite graph into cycles. Discret. Math. 117(1-3): 287-291 (1993) - [j2]Hong Wang:
P2p-factorization of a complete bipartite graph. Discret. Math. 120(1-3): 307-308 (1993) - [j1]Hong Wang, Norbert Sauer:
Packing Three Copies of a Tree into a Complete Graph. Eur. J. Comb. 14(2): 137-142 (1993)
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-07-16 22:54 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:
