default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDanjun Huang
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j24]Danjun Huang, Xianxi Wu
:
Equitable Coloring of IC-Planar Graphs with Girth g ≥ 7. Axioms 12(9): 822 (2024)- 2023
- [j23]Danjun Huang, Hongfeng Cai, Weifan Wang, Jingjing Huo:
Neighbor-distinguishing indices of planar graphs with maximum degree ten. Discret. Appl. Math. 329: 49-60 (2023) - 2022
- [j22]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) - [j21]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) - [j20]Haiyang Zhu, Junlei Zhu, Ying Liu, Shuling Wang, Danjun Huang, Lianying Miao:
Optimal frequency assignment and planar list L(2, 1)-labeling. J. Comb. Optim. 44(4): 2748-2761 (2022) - 2021
- [j19]Danjun Huang, Jingran Qi:
DP-coloring on planar graphs without given adjacent short cycles. Discret. Math. Algorithms Appl. 13(2): 2150013:1-2150013:13 (2021) - 2020
- [j18]Yang Wang, Danjun Huang, Stephen Finbow:
On the vertex partition of planar graphs into forests with bounded degree. Appl. Math. Comput. 374: 125032 (2020) - [j17]Danjun Huang, Xiaoxiu Zhang, Weifan Wang, Stephen Finbow:
Adjacent vertex distinguishing edge coloring of planar graphs without 3-cycles. Discret. Math. Algorithms Appl. 12(4): 2050035:1-2050035:16 (2020) - [c2]Haiyang Zhu, Junlei Zhu, Ying Liu, Shuling Wang, Danjun Huang, Lianying Miao:
The List L(2, 1)-Labeling of Planar Graphs with Large Girth. AAIM 2020: 501-512
2010 – 2019
- 2019
- [j16]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) - [j15]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
- [j14]Daiqiang Hu, Danjun Huang, Weifan Wang, Jian-Liang Wu:
Planar graphs without chordal 6-cycles are 4-choosable. Discret. Appl. Math. 244: 116-123 (2018) - [j13]Jing Lv, Danjun Huang:
A new sufficient condition for a toroidal graph to be 4-choosable. Discret. Math. 341(10): 2878-2882 (2018) - 2016
- [j12]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
- [j11]Xiaohan Cheng, Danjun Huang, Guanghui Wang, Jian-Liang Wu:
Neighbor sum distinguishing total colorings of planar graphs with maximum degree Δ. Discret. Appl. Math. 190-191: 34-41 (2015) - [j10]Danjun Huang, Zhengke Miao, Weifan Wang:
Adjacent vertex distinguishing indices of planar graphs without 3-cycles. Discret. Math. 338(3): 139-148 (2015) - [j9]Wei-Fan Wang, Danjun Huang:
A Characterization on the Adjacent Vertex Distinguishing Index of Planar Graphs with Large Maximum Degree. SIAM J. Discret. Math. 29(4): 2412-2431 (2015) - [c1]Danjun Huang, Ko-Wei Lih, Wei-Fan Wang:
Legally (\varDelta +2) ( Δ + 2 ) -Coloring Bipartite Outerplanar Graphs in Cubic Time. COCOA 2015: 617-632 - 2014
- [j8]Weifan Wang, Danjun Huang:
The adjacent vertex distinguishing total coloring of planar graphs. J. Comb. Optim. 27(2): 379-396 (2014) - [j7]Chengchao Yan, Danjun Huang, Dong Chen, Weifan Wang:
Adjacent vertex distinguishing edge colorings of planar graphs with girth at least five. J. Comb. Optim. 28(4): 893-909 (2014) - [j6]Mirko Hornák, Danjun Huang, Weifan Wang:
On Neighbor-Distinguishing Index of Planar Graphs. J. Graph Theory 76(4): 262-278 (2014) - 2013
- [j5]Danjun Huang, Weifan Wang:
Vertex arboricity of planar graphs without chordal 6-cycles. Int. J. Comput. Math. 90(2): 258-272 (2013) - 2012
- [j4]Danjun Huang, Weifan Wang, Jianxing Yin:
A Note on General Neighbor-Distinguishing Total Coloring of Graphs. Ars Comb. 107: 379-384 (2012) - [j3]Danjun Huang, Weifan Wang:
Planar Graphs of Maximum Degree Six without 7-cycles are Class One. Electron. J. Comb. 19(3): 17 (2012) - [j2]Danjun Huang, Wai Chee Shiu, Weifan Wang:
On the vertex-arboricity of planar graphs without 7-cycles. Discret. Math. 312(15): 2304-2315 (2012) - [j1]Danjun Huang, Weifan Wang, Chengchao Yan:
A note on the adjacent vertex distinguishing total chromatic number of graphs. Discret. Math. 312(24): 3544-3546 (2012)
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-04-25 05: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:
