Danjun Huang

From MaRDI portal
Person:288233

Available identifiers

zbMath Open huang.danjunMaRDI QIDQ288233

List of research outcomes





PublicationDate of PublicationType
Variable degeneracy of planar graphs without chorded 6-cycles2024-12-12Paper
https://portal.mardi4nfdi.de/entity/Q61237182024-04-08Paper
Neighbor Sum Distinguishing Total Chromatic Number of Graphs with Lower Average Degree2024-02-26Paper
Neighbor-distinguishing indices of planar graphs with maximum degree ten2023-02-24Paper
不含带弦6-圈和项链图的平面图是DP-4-可染的2022-09-30Paper
https://portal.mardi4nfdi.de/entity/Q50379942022-09-29Paper
Two sufficient conditions for a planar graph to be list vertex-2-arborable2022-04-11Paper
Adjacent vertex distinguishing index of bipartite planar graphs2022-03-21Paper
A local condition for planar graphs to be 4-choosable2022-03-21Paper
Adjacent vertex distinguishing total coloring of planar graphs with large maximum degree2021-12-17Paper
DP-coloring on planar graphs without given adjacent short cycles2021-11-25Paper
Adjacent vertex distinguishing edge coloring of planar graphs without 3-cycles2021-04-09Paper
https://portal.mardi4nfdi.de/entity/Q51428392021-01-14Paper
https://portal.mardi4nfdi.de/entity/Q51293612020-10-27Paper
Adjacent vertex distinguishing edge coloring of planar graphs without 4-cycles2020-06-09Paper
On the vertex partition of planar graphs into forests with bounded degree2020-02-12Paper
List coloring and diagonal coloring for plane graphs of diameter two2020-01-09Paper
DP-coloring for planar graphs of diameter two2019-10-22Paper
Planar graphs with \(\Delta =9\) are neighbor-distinguishing totally 12-colorable2019-06-25Paper
A new sufficient condition for a toroidal graph to be 4-choosable2018-08-15Paper
Planar graphs without chordal 6-cycles are 4-choosable2018-05-24Paper
https://portal.mardi4nfdi.de/entity/Q29873092017-05-17Paper
Distance vertex-distinguishing index of outerplanar graphs2016-10-06Paper
A polynomial-time nearly-optimal algorithm for an edge coloring problem in outerplanar graphs2016-05-25Paper
Legally $$(\varDelta +2)$$ ( Δ + 2 ) -Coloring Bipartite Outerplanar Graphs in Cubic Time2016-02-05Paper
A Characterization on the Adjacent Vertex Distinguishing Index of Planar Graphs with Large Maximum Degree2016-01-04Paper
Neighbor sum distinguishing total colorings of planar graphs with maximum degree \(\varDelta\)2015-07-06Paper
Adjacent vertex distinguishing edge colorings of planar graphs with girth at least five2015-01-21Paper
Adjacent vertex distinguishing indices of planar graphs without 3-cycles2014-12-19Paper
On Neighbor-Distinguishing Index of Planar Graphs2014-08-07Paper
The adjacent vertex distinguishing total coloring of planar graphs2014-04-08Paper
Vertex arboricity of planar graphs without chordal 6-cycles2013-12-23Paper
A note on general neighbor-distinguishing total coloring of graphs.2013-12-06Paper
Class I graphs of nonnegative characteristic without special cycles2013-11-19Paper
Adjacent vertex distinguishing edge-colorings of planar graphs with girth at least four2013-11-19Paper
A note on the adjacent vertex distinguishing total chromatic number of graphs2012-11-20Paper
Planar graphs of maximum degree six without 7-cycles are class one2012-10-24Paper
On the vertex-arboricity of planar graphs without 7-cycles2012-08-10Paper
(2,1)-total number of joins of paths and cycles2012-06-04Paper
The relationship between \(BS(H)\) and \(BS(G)\)2007-04-10Paper
https://portal.mardi4nfdi.de/entity/Q33726342006-03-09Paper
https://portal.mardi4nfdi.de/entity/Q46757492005-05-06Paper

Research outcomes over time

This page was built for person: Danjun Huang