Danjun Huang

Orcid: 0000-0003-1179-1883

According to our database1, Danjun Huang authored at least 26 papers between 2012 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Equitable Coloring of IC-Planar Graphs with Girth g ≥ 7.
Axioms, September, 2024

2023
Neighbor-distinguishing indices of planar graphs with maximum degree ten.
Discret. Appl. Math., April, 2023

2022
Optimal frequency assignment and planar list L(2, 1)-labeling.
J. Comb. Optim., 2022

Structure and pancyclicity of maximal planar graphs with diameter two.
J. Comb. Optim., 2022

Two sufficient conditions for a planar graph to be list vertex-2-arborable.
Discret. Math., 2022

2021
DP-coloring on planar graphs without given adjacent short cycles.
Discret. Math. Algorithms Appl., 2021

2020
Adjacent vertex distinguishing edge coloring of planar graphs without 3-cycles.
Discret. Math. Algorithms Appl., 2020

On the vertex partition of planar graphs into forests with bounded degree.
Appl. Math. Comput., 2020

The List L(2, 1)-Labeling of Planar Graphs with Large Girth.
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

List coloring and diagonal coloring for plane graphs of diameter two.
Appl. Math. Comput., 2019

2018
A new sufficient condition for a toroidal graph to be 4-choosable.
Discret. Math., 2018

Planar graphs without chordal 6-cycles are 4-choosable.
Discret. Appl. 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

Adjacent vertex distinguishing indices of planar graphs without 3-cycles.
Discret. Math., 2015

Neighbor sum distinguishing total colorings of planar graphs with maximum degree Δ.
Discret. Appl. Math., 2015

Legally (\varDelta +2) ( Δ + 2 ) -Coloring Bipartite Outerplanar Graphs in Cubic Time.
Proceedings of the Combinatorial Optimization and Applications, 2015

2014
On Neighbor-Distinguishing Index of Planar Graphs.
J. Graph Theory, 2014

Adjacent vertex distinguishing edge colorings of planar graphs with girth at least five.
J. Comb. Optim., 2014

The adjacent vertex distinguishing total coloring of planar graphs.
J. Comb. Optim., 2014

2013
Vertex arboricity of planar graphs without chordal 6-cycles.
Int. J. Comput. Math., 2013

2012
A note on the adjacent vertex distinguishing total chromatic number of graphs.
Discret. Math., 2012

On the vertex-arboricity of planar graphs without 7-cycles.
Discret. Math., 2012

Planar Graphs of Maximum Degree Six without 7-cycles are Class One.
Electron. J. Comb., 2012

A Note on General Neighbor-Distinguishing Total Coloring of Graphs.
Ars Comb., 2012


  Loading...