Danjun Huang

Publication Activity (10 Years)

Years Active: 2012-2024
Publications (10 Years): 14

Top Topics

Graph Isomorphism

Top Venues

J. Comb. Optim.

Discret. Appl. Math.

Appl. Math. Comput.

Publications

Danjun Huang, Xianxi Wu
Equitable Coloring of IC-Planar Graphs with Girth g ≥ 7. Axioms 12 (9) (2024)
Danjun Huang, Hongfeng Cai, Weifan Wang, Jingjing Huo
Neighbor-distinguishing indices of planar graphs with maximum degree ten. Discret. Appl. Math. 329 (2023)
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) (2022)
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) (2022)
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) (2022)
Danjun Huang, Jingran Qi
DP-coloring on planar graphs without given adjacent short cycles. Discret. Math. Algorithms Appl. 13 (2) (2021)
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) (2020)
Yang Wang, Danjun Huang, Stephen Finbow
On the vertex partition of planar graphs into forests with bounded degree. Appl. Math. Comput. 374 (2020)
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)
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) (2019)
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)
Daiqiang Hu, Danjun Huang, Weifan Wang, Jian-Liang Wu
Planar graphs without chordal 6-cycles are 4-choosable. Discret. Appl. Math. 244 (2018)
Jing Lv, Danjun Huang
A new sufficient condition for a toroidal graph to be 4-choosable. Discret. Math. 341 (10) (2018)
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) (2016)
Xiaohan Cheng, Danjun Huang, Guanghui Wang, Jian-Liang Wu
Neighbor sum distinguishing total colorings of planar graphs with maximum degree Δ. Discret. Appl. Math. (2015)
Danjun Huang, Zhengke Miao, Weifan Wang
Adjacent vertex distinguishing indices of planar graphs without 3-cycles. Discret. Math. 338 (3) (2015)
Danjun Huang, Ko-Wei Lih, Wei-Fan Wang
Legally (\varDelta +2) ( Δ + 2 ) -Coloring Bipartite Outerplanar Graphs in Cubic Time. COCOA (2015)
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) (2015)
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) (2014)
Mirko Hornák, Danjun Huang, Weifan Wang
On Neighbor-Distinguishing Index of Planar Graphs. J. Graph Theory 76 (4) (2014)
Weifan Wang, Danjun Huang
The adjacent vertex distinguishing total coloring of planar graphs. J. Comb. Optim. 27 (2) (2014)
Danjun Huang, Weifan Wang
Vertex arboricity of planar graphs without chordal 6-cycles. Int. J. Comput. Math. 90 (2) (2013)
Danjun Huang, Weifan Wang, Chengchao Yan
A note on the adjacent vertex distinguishing total chromatic number of graphs. Discret. Math. 312 (24) (2012)
Danjun Huang, Wai Chee Shiu, Weifan Wang
On the vertex-arboricity of planar graphs without 7-cycles. Discret. Math. 312 (15) (2012)
Danjun Huang, Weifan Wang, Jianxing Yin
A Note on General Neighbor-Distinguishing Total Coloring of Graphs. Ars Comb. 107 (2012)
Danjun Huang, Weifan Wang
Planar Graphs of Maximum Degree Six without 7-cycles are Class One. Electron. J. Comb. 19 (3) (2012)