default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDHaichao Wang 0004
Person information
- affiliation: Shanghai University of Electric Power, Department of Mathematics, China
- affiliation: Shanghai University, School of Management, China
Other persons with the same name
- Haichao Wang — disambiguation page
- Haichao Wang 0001
![[0000-0001-6551-908X]](https://dblp.uni-trier.de./img/orcid-mark.12x12.png "0000-0001-6551-908X")
— Army Engineering University of PLA, College of Communications Engineering, Nanjing, China - Haichao Wang 0002 — Henan Polytechnic University, College of Computer Science and Technology, Jiaozuo, China
- Haichao Wang 0003 — Long Yuan Wind Power Engineering & Consulting Co., Ltd, Beijing, China
- Haichao Wang 0005 — Huazhong University of Science and Technology, Department of Electronics and Information Engineering, Wuhan, China
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2019
[j15]Haichao Wang, Hye Kyung Kim:
Signed Domination Number of the Directed Cylinder. Symmetry 11(12): 1443 (2019)- 2018
- [j14]Yun-Ping Deng, Haichao Wang, Yancai Zhao:
The complexity od secure domination problem in graphs. Discuss. Math. Graph Theory 38(2): 385-396 (2018) - 2017
- [j13]Yun-Ping Deng, Yu-Qin Sun, Qiong Liu, Haichao Wang:
Efficient dominating sets in circulant graphs. Discret. Math. 340(7): 1503-1507 (2017) - 2016
- [j12]Haichao Wang, Erfang Shan, Yancai Zhao:
3-Factor-Criticality in Double Domination Edge Critical Graphs. Graphs Comb. 32(4): 1599-1610 (2016) - 2015
- [j11]Simon Crevals, Haichao Wang, Hye Kyung Kim, Hunki Baek:
Domination number of the directed cylinder. Australas. J Comb. 61: 192-209 (2015) - 2014
- [j10]Wenyao Song, Lianying Miao, Haichao Wang, Yancai Zhao:
Maximal matching and edge domination in complete multipartite graphs. Int. J. Comput. Math. 91(5): 857-862 (2014) - [j9]Haichao Wang, Hye Kyung Kim:
Signed 2-independence of Cartesian product of directed paths. Int. J. Comput. Math. 91(6): 1190-1201 (2014) - 2013
- [j8]Haichao Wang, Erfang Shan:
Signed total k-domination in graphs. Ars Comb. 111: 37-52 (2013) - 2012
- [j7]Gerard Jennhwa Chang, Paul Dorbec, Hye Kyung Kim, André Raspaud, Haichao Wang, Weiliang Zhao:
Upper k-tuple domination in graphs. Discret. Math. Theor. Comput. Sci. 14(2): 285-292 (2012) - 2011
- [j6]Erfang Shan, Haichao Wang:
Claw-free cubic graphs with clique-transversal number half of their order. Appl. Math. Lett. 24(7): 1080-1083 (2011) - 2010
- [j5]Haichao Wang, Erfang Shan:
Some matching properties in 4-gamma×2-critical graphs. Comput. Math. Appl. 59(2): 694-699 (2010) - [j4]Haichao Wang, Liying Kang:
Matching Properties in Double domination Edge Critical Graphs. Discret. Math. Algorithms Appl. 2(2): 151-160 (2010) - [j3]Haichao Wang, Liying Kang, Erfang Shan:
Signed clique-transversal functions in graphs. Int. J. Comput. Math. 87(11): 2398-2407 (2010)
2000 – 2009
- 2009
- [j2]Haichao Wang, Erfang Shan:
Upper minus total domination of a 5-regular graph. Ars Comb. 91 (2009) - [j1]Haichao Wang, Liying Kang, Erfang Shan:
Matching Properties in Total Domination Vertex Critical Graphs. Graphs Comb. 25(6): 851-861 (2009)
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 2025-03-10 21:53 CET 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:
