Danjun Huang
Orcid: 0000-0003-1179-1883
According to our database1,
Danjun Huang
authored at least 26 papers
between 2012 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
2012
2014
2016
2018
2020
2022
2024
0
1
2
3
4
5
1
1
3
1
2
2
2
1
3
3
1
4
1
1
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
On csauthors.net:
Bibliography
2024
2023
Discret. Appl. Math., April, 2023
2022
J. Comb. Optim., 2022
Discret. Math., 2022
2021
Discret. Math. Algorithms Appl., 2021
2020
Discret. Math. Algorithms Appl., 2020
Appl. Math. Comput., 2020
Proceedings of the Algorithmic Aspects in Information and Management, 2020
2019
Planar graphs with $$\Delta =9$$ Δ = 9 are neighbor-distinguishing totally 12-colorable.
J. Comb. Optim., 2019
Appl. Math. Comput., 2019
2018
Discret. Math., 2018
2016
A polynomial-time nearly-optimal algorithm for an edge coloring problem in outerplanar graphs.
J. Glob. Optim., 2016
2015
A Characterization on the Adjacent Vertex Distinguishing Index of Planar Graphs with Large Maximum Degree.
SIAM J. Discret. Math., 2015
Discret. Math., 2015
Discret. Appl. Math., 2015
Legally (\varDelta +2) ( Δ + 2 ) -Coloring Bipartite Outerplanar Graphs in Cubic Time.
Proceedings of the Combinatorial Optimization and Applications, 2015
2014
Adjacent vertex distinguishing edge colorings of planar graphs with girth at least five.
J. Comb. Optim., 2014
J. Comb. Optim., 2014
2013
Int. J. Comput. Math., 2013
2012
Discret. Math., 2012
Electron. J. Comb., 2012
A Note on General Neighbor-Distinguishing Total Coloring of Graphs.
Ars Comb., 2012