default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDYiqiao Wang 0002
Person information
- affiliation: Beijing University of Technology, Faculty of Sciencem Department of Mathematics, China
- affiliation (former): Zhejiang Normal University, Department of Mathematics, Jinhua, China
- affiliation (former): Beijing University of Chinese Medicine, Beijing, China
- affiliation (former): Department of Mathematics, Zhejiang Normal University, Jinhua, China
Other persons with the same name
- Yiqiao Wang 0001 — University of Toronto
- Yiqiao Wang 0003 — University of Chinese Academy of Sciences, Beijing, China
- Yiqiao Wang 0004 — East China Normal University, School of Computer Science and Technology, Shanghai, China
- Yiqiao Wang 0005 — LuxiTech
- Yiqiao Wang 0006 — Yantai University, School of Opto-Electronic Information Science and Technology, China
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j68]Ran Gu, Hui Lei, Yongtang Shi, Yiqiao Wang:
A note on rainbow-free colorings of uniform hypergraphs. Discret. Appl. Math. 344: 161-169 (2024)- [j67]Wei Gao, Yiqiao Wang, Weifan Wang:
A sufficient condition for a graph to be fractional (k,n)-critical. Discret. Math. 347(6): 114008 (2024) - [j66]Yang Wang, Yiqiao Wang, Weifan Wang, Lina Zheng:
A note on the list vertex-arboricity of IC-planar graphs. Discret. Math. 347(7): 113998 (2024) - [j65]Weifan Wang, Juan Liu, Yiqiao Wang:
Linear arboricity of 1-planar graphs. Discuss. Math. Graph Theory 44(2): 435 (2024) - [j64]Jianfeng Wang
, Wenqian Zhang, Yiqiao Wang, Zoran Stanic:
On the order of antipodal covers. J. Graph Theory 105(2): 285-296 (2024) - 2023
- [j63]Jiangxu Kong, Yiqiao Wang, Jiacheng Hu, Yang Wang, Weifan Wang:
Plane graphs of diameter two are 2-optimal. Appl. Math. Comput. 441: 127717 (2023) - [j62]Yiqiao Wang, Jingjing Huo, Jiangxu Kong, Qiuyue Tan:
Coloring the square of maximal planar graphs with diameter two. Appl. Math. Comput. 459: 128263 (2023) - [j61]Lina Zheng, Yiqiao Wang, Weifan Wang:
The Difference of Zagreb Indices of Halin Graphs. Axioms 12(5): 450 (2023) - [j60]Weiying Xing, Yinni Shi, Chaoyong Wu, Yiqiao Wang, Xu Wang:
Predicting blood pressure from face videos using face diagnosis theory and deep neural networks technique. Comput. Biol. Medicine 164: 107112 (2023) - [j59]Jing Gu, Yiqiao Wang, Weifan Wang, Lina Zheng:
Strict neighbor-distinguishing index of K4-minor-free graphs. Discret. Appl. Math. 329: 87-95 (2023) - [j58]Hui Lei, Xiaopan Lian, Xianhao Meng, Yongtang Shi, Yiqiao Wang:
On critical graphs for the chromatic edge-stability number. Discret. Math. 346(5): 113307 (2023) - [j57]En Zhang, Zihao Nie, Qiang Yang, Yiqiao Wang, Dong Liu, Sang-Woon Jeon, Jun Zhang:
Heterogeneous cognitive learning particle swarm optimization for large-scale optimization problems. Inf. Sci. 633: 321-342 (2023) - [j56]Junna Zhang, Degang Chen, Qiang Yang, Yiqiao Wang, Dong Liu, Sang-Woon Jeon, Jun Zhang:
Proximity ranking-based multimodal differential evolution. Swarm Evol. Comput. 78: 101277 (2023) - [j55]Dong Liu, Hao He, Qiang Yang, Yiqiao Wang, Sang-Woon Jeon, Jun Zhang:
Function value ranking aware differential evolution for global numerical optimization. Swarm Evol. Comput. 78: 101282 (2023) - [j54]Haizhen Qiu, Yushi Che, Yiqiao Wang:
L(2, 1)-Labeling Halin Graphs with Maximum Degree Eight. Symmetry 15(1): 50 (2023) - 2022
- [j53]Ying Wang, Yiqiao Wang, Weifan Wang, Shuyu Cui:
Strong Chromatic Index of Outerplanar Graphs. Axioms 11(4): 168 (2022) - [j52]Yiqiao Wang, Yanping Yang, Danjun Huang, Weifan Wang:
Two sufficient conditions for a planar graph to be list vertex-2-arborable. Discret. Math. 345(6): 112865 (2022) - [j51]Shu-Yu Cui, Yiqiao Wang, Danjun Huang, Hongwei Du, Weifan Wang:
Structure and pancyclicity of maximal planar graphs with diameter two. J. Comb. Optim. 43(1): 1-27 (2022) - [j50]Juan Liu, Yiqiao Wang, Weifan Wang:
Light edges in 1-planar graphs. J. Graph Theory 101(4): 746-768 (2022) - [j49]Yiqiao Wang, Juan Liu, Yongtang Shi, Weifan Wang:
Star Chromatic Index of 1-Planar Graphs. Symmetry 14(6): 1177 (2022) - 2021
- [j48]Weifan Wang, Xiaoxue Hu, Yiqiao Wang:
Entire coloring of 2-connected plane graphs. Eur. J. Comb. 94: 103286 (2021) - [j47]Jing Gu, Weifan Wang, Yiqiao Wang, Ying Wang:
Strict Neighbor-Distinguishing Index of Subcubic Graphs. Graphs Comb. 37(1): 355-368 (2021) - [j46]Wei Gao, Yaojun Chen, Yiqiao Wang:
Network vulnerability parameter and results on two surfaces. Int. J. Intell. Syst. 36(8): 4392-4414 (2021) - [j45]Wanshun Yang, Yiqiao Wang, Wei-Fan Wang, Ko-Wei Lih:
IC-Planar Graphs Are 6-Choosable. SIAM J. Discret. Math. 35(3): 1729-1745 (2021) - 2020
- [j44]Yiqiao Wang, Lina Zheng:
Computation on the difference of Zagreb indices of maximal planar graphs with diameter two. Appl. Math. Comput. 377: 125187 (2020) - [j43]Wanshun Yang, Weifan Wang, Yiqiao Wang:
An improved upper bound for the acyclic chromatic number of 1-planar graphs. Discret. Appl. Math. 283: 275-291 (2020) - [j42]Jingjing Huo, Yiqiao Wang, Weifan Wang, Wenjing Xia:
Neighbor-distinguishing total coloring of planar graphs with maximum degree twelve. J. Comb. Optim. 39(1): 246-272 (2020) - [j41]Jiangxu Kong, Xiaoxue Hu, Yiqiao Wang:
Plane graphs with Δ =7 are entirely 10-colorable. J. Comb. Optim. 40(1): 1-20 (2020) - [j40]Yiqiao Wang, Xiaoxue Hu, Weifan Wang, Ko-Wei Lih:
Plane graphs of maximum degree Δ ≥ 7 are edge-face (Δ + 1)-colorable. J. Graph Theory 95(1): 99-124 (2020)
2010 – 2019
- 2019
- [j39]Ying Wang, Yiqiao Wang, Weifan Wang:
Star edge-coloring of graphs with maximum degree four. Appl. Math. Comput. 340: 268-275 (2019) - [j38]Danjun Huang, Yiqiao Wang, Jing Lv, Yanping Yang, Weifan Wang:
List coloring and diagonal coloring for plane graphs of diameter two. Appl. Math. Comput. 363 (2019) - [j37]Juan Liu, Xiaoxue Hu, Weifan Wang, Yiqiao Wang:
Light structures in 1-planar graphs with an application to linear 2-arboricity. Discret. Appl. Math. 267: 120-130 (2019) - [j36]Wanshun Yang, Weifan Wang, Yiqiao Wang:
Acyclic coloring of IC-planar graphs. Discret. Math. 342(12) (2019) - [j35]Weifan Wang, Jingjing Huo, Danjun Huang, Yiqiao Wang:
Planar graphs with $$\Delta =9$$ Δ = 9 are neighbor-distinguishing totally 12-colorable. J. Comb. Optim. 37(3): 1071-1089 (2019) - 2018
- [j34]Yiqiao Wang, Weifan Wang, Ying Wang:
Edge-partition and star chromatic index. Appl. Math. Comput. 333: 480-489 (2018) - [j33]Jingjing Huo, Weifan Wang, Yiqiao Wang:
A characterization for the neighbor-distinguishing total chromatic number of planar graphs with Δ=13. Discret. Math. 341(11): 3044-3056 (2018) - [j32]Yiqiao Wang, Min Chen, Weifan Wang:
A note on the list vertex arboricity of toroidal graphs. Discret. Math. 341(12): 3344-3347 (2018) - [j31]Xiaoxue Hu, Weifan Wang, Yiqiao Wang, Ping Wang:
Entire Coloring of Graphs Embedded in a Surface of Nonnegative Characteristic. Graphs Comb. 34(6): 1489-1506 (2018) - [j30]Yiqiao Wang, Ping Wang, Weifan Wang:
Strong chromatic index of K4-minor free graphs. Inf. Process. Lett. 129: 53-56 (2018) - [j29]Weifan Wang, Tingting Wu, Xiaoxue Hu, Yiqiao Wang:
Planar graphs without chordal 5-cycles are 2-good. J. Comb. Optim. 35(3): 980-996 (2018) - 2017
- [j28]Yiqiao Wang, Xiaoxue Hu, Weifan Wang:
The chromatic number of the square of a Halin graph with maximum degree five is six. Ars Comb. 133: 217-231 (2017) - [j27]Yiqiao Wang, Xiaoxue Hu, Wei-Fan Wang:
A note on the linear 2-arboricity of planar graphs. Discret. Math. 340(7): 1449-1455 (2017) - [j26]Yiqiao Wang:
On the linear 2-arboricity of planar graph without normally adjacent 3-cycles and 4-cycles. Int. J. Comput. Math. 94(5): 981-988 (2017) - [j25]Miao Zhang, Min Chen, Yiqiao Wang:
A sufficient condition for planar graphs with girth 5 to be (1, 7)-colorable. J. Comb. Optim. 33(3): 847-865 (2017) - [j24]Qiaojun Shu, Weifan Wang, Yiqiao Wang:
A new sufficient condition for a tree T to have the (2, 1)-total number Δ + 1. J. Comb. Optim. 33(3): 1011-1020 (2017) - [j23]Jingjing Huo, Yiqiao Wang, Weifan Wang:
Neighbor-sum-distinguishing edge choosability of subcubic graphs. J. Comb. Optim. 34(3): 742-759 (2017) - [j22]Min Chen, Yingying Fan, Yiqiao Wang, Weifan Wang:
A sufficient condition for planar graphs to be (3, 1)-choosable. J. Comb. Optim. 34(4): 987-1011 (2017) - [j21]Xiaoxue Hu, Ping Wang, Yiqiao Wang, Weifan Wang:
The entire chromatic number of graphs embedded on the torus with large maximum degree. Theor. Comput. Sci. 689: 108-116 (2017) - 2016
- [j20]Xiaoxue Hu, Weifan Wang, Wai Chee Shiu, Yiqiao Wang:
Plane graphs with maximum degree 9 are entirely 11-choosable. Discret. Math. 339(11): 2742-2753 (2016) - [j19]Wei-Fan Wang, Tingting Wu, Xiaoxue Hu, Yiqiao Wang:
The entire choosability of plane graphs. J. Comb. Optim. 31(3): 1221-1240 (2016) - [j18]Weifan Wang, Danjun Huang, Yanwen Wang, Yiqiao Wang, Ding-Zhu Du:
A polynomial-time nearly-optimal algorithm for an edge coloring problem in outerplanar graphs. J. Glob. Optim. 65(2): 351-367 (2016) - 2015
- [j17]Hao Gui, Weifan Wang, Yiqiao Wang, Zhao Zhang:
Equitable total-coloring of subcubic graphs. Discret. Appl. Math. 184: 167-170 (2015) - [j16]Yiqiao Wang, Wei-Fan Wang, Jingjing Huo:
Some bounds on the neighbor-distinguishing index of graphs. Discret. Math. 338(11): 2006-2013 (2015) - 2014
- [j15]Xiaoxue Hu, Weifan Wang, Yiqiao Wang:
The edge-face choosability of plane graphs with maximum degree at least 9. Discret. Math. 327: 1-8 (2014) - [j14]Xiaoxue Hu, Yiqiao Wang:
Plane graphs are entirely (δ + 5)-Choosable. Discret. Math. Algorithms Appl. 6(2) (2014) - [j13]Yiqiao Wang, Qiaojun Shu, Jian-Liang Wu, Wenwen Zhang:
Acyclic edge coloring of planar graphs without a 3-cycle adjacent to a 6-cycle. J. Comb. Optim. 28(3): 692-715 (2014) - [j12]Yiqiao Wang, Xiaoxue Hu, Wei-Fan Wang:
Planar Graphs with $\Delta\ge 9$ are Entirely (Δ+2)-Colorable. SIAM J. Discret. Math. 28(4): 1892-1905 (2014) - 2013
- [j11]Yiqiao Wang, Qiaojun Shu, Weifan Wang:
The acyclic edge coloring of planar graphs without a 3-cycle adjacent to a 4-cycle. Discret. Appl. Math. 161(16-17): 2687-2694 (2013) - [j10]Qiaojun Shu, Yiqiao Wang, Weifan Wang:
Acyclic list edge coloring of outerplanar graphs. Discret. Math. 313(3): 301-311 (2013) - [j9]Weifan Wang, Qiaojun Shu, Yiqiao Wang:
A new upper bound on the acyclic chromatic indices of planar graphs. Eur. J. Comb. 34(2): 338-354 (2013) - [j8]Weifan Wang, Yiqiao Wang:
Linear Coloring of Planar Graphs Without 4-Cycles. Graphs Comb. 29(4): 1113-1124 (2013) - [j7]Weifan Wang, Qiaojun Shu, Yiqiao Wang:
Acyclic edge coloring of planar graphs without 4-cycles. J. Comb. Optim. 25(4): 562-586 (2013) - [j6]Qiaojun Shu, Weifan Wang, Yiqiao Wang:
Acyclic Chromatic Indices of Planar Graphs with Girth At Least 4. J. Graph Theory 73(4): 386-399 (2013) - 2012
- [j5]Qiaojun Shu, Weifan Wang, Yiqiao Wang:
Acyclic edge coloring of planar graphs without 5-cycles. Discret. Appl. Math. 160(7-8): 1211-1223 (2012) - [i1]Weifan Wang, Qiaojun Shu, Yiqiao Wang:
Every 4-regular graph is acyclically edge-6-colorable. CoRR abs/1209.2471 (2012) - 2011
- [j4]Weifan Wang, Yiqiao Wang:
Adjacent vertex-distinguishing edge colorings of K4-minor free graphs. Appl. Math. Lett. 24(12): 2034-2037 (2011) - 2010
- [j3]Yiqiao Wang, Weifan Wang:
Adjacent vertex distinguishing total colorings of outerplanar graphs. J. Comb. Optim. 19(2): 123-133 (2010) - [j2]Weifan Wang, Yiqiao Wang:
Adjacent vertex distinguishing edge-colorings of graphs with smaller maximum average degree. J. Comb. Optim. 19(4): 471-485 (2010)
2000 – 2009
- 2006
- [j1]Weifan Wang, Yiqiao Wang:
L(p, q)-labelling of K4-minor free graphs. Inf. Process. Lett. 98(5): 169-173 (2006)
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-10-21 20:28 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:
