Yiqiao Wang 0002

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with Danjun Huang

> Home > Persons > Yiqiao Wang 0002

Publications

2022
[j52]
- view
  authority control:
- export record
  dblp key:
  - journals/dm/WangYHW22
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/dm/WangYHW22
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]
- view
  authority control:
- export record
  dblp key:
  - journals/jco/CuiWHDW22
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jco/CuiWHDW22
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)
2019
[j38]
- view
  authority control:
- export record
  dblp key:
  - journals/amc/HuangWLYW19
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/amc/HuangWLYW19
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)
[j35]
- view
  authority control:
- export record
  dblp key:
  - journals/jco/WangHHW19
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jco/WangHHW19
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)
2016
[j18]
- view
  authority control:
- export record
  dblp key:
  - journals/jgo/WangHWWD16
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jgo/WangHWWD16
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)

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.