Danjun Huang

30 papers C 2Journal 28
YearRankTypeTitle / Venue / Authors
2026 J jnl
A sufficient condition for planar graphs with girth 5 to be (2, 4)-colorable.
Discret. Appl. Math.
Ganchao Zhang, Min Chen, Danjun Huang, Weifan Wang
2025 J jnl
The strict neighbor-distinguishing index of simple graphs with maximum degree five.
Ars Comb.
Danjun Huang, Jiayan Wang, Weifan Wang, Puning Jing
2025 J jnl
Vertex partitions of
Discuss. Math. Graph Theory
Fei Zhang, Danjun Huang
2024 J jnl
Equitable Coloring of IC-Planar Graphs with Girth g ≥ 7.
Axioms
Danjun Huang, Xianxi Wu
2024 J jnl
Equitable coloring of planar graphs without 5-cycles and chordal 4-cycles.
Discret. Math. Algorithms Appl.
Xianxi Wu, Danjun Huang
2023 J jnl
Neighbor-distinguishing indices of planar graphs with maximum degree ten.
Discret. Appl. Math.
Danjun Huang, Hongfeng Cai, Weifan Wang, Jingjing Huo
2022 J jnl
Optimal frequency assignment and planar list L(2, 1)-labeling.
J. Comb. Optim.
Haiyang Zhu, Junlei Zhu, Ying Liu, Shuling Wang, Danjun Huang, Lianying Miao
2022 J jnl
Structure and pancyclicity of maximal planar graphs with diameter two.
J. Comb. Optim.
Shu-Yu Cui, Yiqiao Wang, Danjun Huang, Hongwei Du, Weifan Wang
2022 J jnl
Two sufficient conditions for a planar graph to be list vertex-2-arborable.
Discret. Math.
Yiqiao Wang, Yanping Yang, Danjun Huang, Weifan Wang
2021 J jnl
DP-coloring on planar graphs without given adjacent short cycles.
Discret. Math. Algorithms Appl.
Danjun Huang, Jingran Qi
2020 J jnl
Adjacent vertex distinguishing edge coloring of planar graphs without 3-cycles.
Discret. Math. Algorithms Appl.
Danjun Huang, Xiaoxiu Zhang, Weifan Wang, Stephen Finbow
2020 J jnl
On the vertex partition of planar graphs into forests with bounded degree.
Appl. Math. Comput.
Yang Wang, Danjun Huang, Stephen Finbow
2020 C conf
The List L(2, 1)-Labeling of Planar Graphs with Large Girth.
AAIM
Haiyang Zhu, Junlei Zhu, Ying Liu, Shuling Wang, Danjun Huang, Lianying Miao
2019 J jnl
List coloring and diagonal coloring for plane graphs of diameter two.
Appl. Math. Comput.
Danjun Huang, Yiqiao Wang, Jing Lv, Yanping Yang, Weifan Wang
2019 J jnl
Planar graphs with $$\Delta =9$$ Δ = 9 are neighbor-distinguishing totally 12-colorable.
J. Comb. Optim.
Weifan Wang, Jingjing Huo, Danjun Huang, Yiqiao Wang
2018 J jnl
A new sufficient condition for a toroidal graph to be 4-choosable.
Discret. Math.
Jing Lv, Danjun Huang
2018 J jnl
Planar graphs without chordal 6-cycles are 4-choosable.
Discret. Appl. Math.
Daiqiang Hu, Danjun Huang, Weifan Wang, Jian-Liang Wu
2016 J jnl
A polynomial-time nearly-optimal algorithm for an edge coloring problem in outerplanar graphs.
J. Glob. Optim.
Weifan Wang, Danjun Huang, Yanwen Wang, Yiqiao Wang, Ding-Zhu Du
2015 J jnl
A Characterization on the Adjacent Vertex Distinguishing Index of Planar Graphs with Large Maximum Degree.
SIAM J. Discret. Math.
Wei-Fan Wang, Danjun Huang
2015 J jnl
Adjacent vertex distinguishing indices of planar graphs without 3-cycles.
Discret. Math.
Danjun Huang, Zhengke Miao, Weifan Wang
2015 C conf
Legally (\varDelta +2) ( Δ + 2 ) -Coloring Bipartite Outerplanar Graphs in Cubic Time.
COCOA
Danjun Huang, Ko-Wei Lih, Wei-Fan Wang
2015 J jnl
Neighbor sum distinguishing total colorings of planar graphs with maximum degree Δ.
Discret. Appl. Math.
Xiaohan Cheng, Danjun Huang, Guanghui Wang, Jian-Liang Wu
2014 J jnl
Adjacent vertex distinguishing edge colorings of planar graphs with girth at least five.
J. Comb. Optim.
Chengchao Yan, Danjun Huang, Dong Chen, Weifan Wang
2014 J jnl
On Neighbor-Distinguishing Index of Planar Graphs.
J. Graph Theory
Mirko Hornák, Danjun Huang, Weifan Wang
2014 J jnl
The adjacent vertex distinguishing total coloring of planar graphs.
J. Comb. Optim.
Weifan Wang, Danjun Huang
2013 J jnl
Vertex arboricity of planar graphs without chordal 6-cycles.
Int. J. Comput. Math.
Danjun Huang, Weifan Wang
2012 J jnl
A Note on General Neighbor-Distinguishing Total Coloring of Graphs.
Ars Comb.
Danjun Huang, Weifan Wang, Jianxing Yin
2012 J jnl
A note on the adjacent vertex distinguishing total chromatic number of graphs.
Discret. Math.
Danjun Huang, Weifan Wang, Chengchao Yan
2012 J jnl
On the vertex-arboricity of planar graphs without 7-cycles.
Discret. Math.
Danjun Huang, Wai Chee Shiu, Weifan Wang
2012 J jnl
Planar Graphs of Maximum Degree Six without 7-cycles are Class One.
Electron. J. Comb.
Danjun Huang, Weifan Wang