A Note on General Neighbor-Distinguishing Total Coloring of Graphs. - Danjun Huang; Weifan Wang 001; Jianxing Yin (Ars Comb., 2012)

Planar Graphs of Maximum Degree Six without 7-cycles are Class One. - Danjun Huang; Weifan Wang 001 (Electron. J. Comb., 2012)

On the vertex-arboricity of planar graphs without 7-cycles. - Danjun Huang; Wai Chee Shiu; Weifan Wang 001 (Discret. Math., 2012)

A note on the adjacent vertex distinguishing total chromatic number of graphs. - Danjun Huang; Weifan Wang 001; Chengchao Yan (Discret. Math., 2012)

Vertex arboricity of planar graphs without chordal 6-cycles. - Danjun Huang; Weifan Wang 001 (Int. J. Comput. Math., 2013)

The adjacent vertex distinguishing total coloring of planar graphs. - Weifan Wang 001; Danjun Huang (J. Comb. Optim., 2014)

Adjacent vertex distinguishing edge colorings of planar graphs with girth at least five. - Chengchao Yan; Danjun Huang; Dong Chen 012; Weifan Wang 001 (J. Comb. Optim., 2014)

On Neighbor-Distinguishing Index of Planar Graphs. - Mirko Hornák; Danjun Huang; Weifan Wang 001 (J. Graph Theory, 2014)

Legally ( varDelta +2) ( Δ + 2 ) -Coloring Bipartite Outerplanar Graphs in Cubic Time. - Danjun Huang; Ko-Wei Lih; Wei-Fan Wang 001 (COCOA, 2015)

Neighbor sum distinguishing total colorings of planar graphs with maximum degree Δ. - Xiaohan Cheng; Danjun Huang; Guanghui Wang 002; Jian-Liang Wu 001 (Discret. Appl. Math., 2015)

Adjacent vertex distinguishing indices of planar graphs without 3-cycles. - Danjun Huang; Zhengke Miao; Weifan Wang 001 (Discret. Math., 2015)

A Characterization on the Adjacent Vertex Distinguishing Index of Planar Graphs with Large Maximum Degree. - Wei-Fan Wang 001; Danjun Huang (SIAM J. Discret. Math., 2015)

A polynomial-time nearly-optimal algorithm for an edge coloring problem in outerplanar graphs. - Weifan Wang 001; Danjun Huang; Yanwen Wang; Yiqiao Wang 002; Ding-Zhu Du (J. Glob. Optim., 2016)

Planar graphs without chordal 6-cycles are 4-choosable. - Daiqiang Hu; Danjun Huang; Weifan Wang 001; Jian-Liang Wu 001 (Discret. Appl. Math., 2018)

A new sufficient condition for a toroidal graph to be 4-choosable. - Jing Lv; Danjun Huang (Discret. Math., 2018)

List coloring and diagonal coloring for plane graphs of diameter two. - Danjun Huang; Yiqiao Wang 002; Jing Lv; Yanping Yang; Weifan Wang 001 (Appl. Math. Comput., 2019)

Planar graphs with $$ Delta =9$$ Δ = 9 are neighbor-distinguishing totally 12-colorable. - Weifan Wang 001; Jingjing Huo; Danjun Huang; Yiqiao Wang 002 (J. Comb. Optim., 2019)

The List L(2, 1)-Labeling of Planar Graphs with Large Girth. - Haiyang Zhu; Junlei Zhu; Ying Liu; Shuling Wang; Danjun Huang; Lianying Miao (AAIM, 2020)

On the vertex partition of planar graphs into forests with bounded degree. - Yang Wang; Danjun Huang; Stephen Finbow (Appl. Math. Comput., 2020)

Adjacent vertex distinguishing edge coloring of planar graphs without 3-cycles. - Danjun Huang; Xiaoxiu Zhang; Weifan Wang 001; Stephen Finbow (Discret. Math. Algorithms Appl., 2020)

DP-coloring on planar graphs without given adjacent short cycles. - Danjun Huang; Jingran Qi (Discret. Math. Algorithms Appl., 2021)

Two sufficient conditions for a planar graph to be list vertex-2-arborable. - Yiqiao Wang 002; Yanping Yang; Danjun Huang; Weifan Wang 001 (Discret. Math., 2022)

Structure and pancyclicity of maximal planar graphs with diameter two. - Shu-Yu Cui; Yiqiao Wang 002; Danjun Huang; Hongwei Du 001; Weifan Wang 001 (J. Comb. Optim., 2022)

Optimal frequency assignment and planar list L(2, 1)-labeling. - Haiyang Zhu; Junlei Zhu; Ying Liu; Shuling Wang; Danjun Huang; Lianying Miao (J. Comb. Optim., 2022)

Neighbor-distinguishing indices of planar graphs with maximum degree ten. - Danjun Huang; Hongfeng Cai; Weifan Wang 001; Jingjing Huo (Discret. Appl. Math., 2023)

Equitable Coloring of IC-Planar Graphs with Girth g ≥ 7. - Danjun Huang; Xianxi Wu (Axioms, 2024)

Equitable coloring of planar graphs without 5-cycles and chordal 4-cycles. - Xianxi Wu; Danjun Huang (Discret. Math. Algorithms Appl., 2024)

The strict neighbor-distinguishing index of simple graphs with maximum degree five. - Danjun Huang; Jiayan Wang; Weifan Wang 001; Puning Jing (Ars Comb., 2025)