The following pages link to Danjun Huang (Q288233):
Displaying 41 items.
- A polynomial-time nearly-optimal algorithm for an edge coloring problem in outerplanar graphs (Q288235) (← links)
- Class I graphs of nonnegative characteristic without special cycles (Q377914) (← links)
- (2,1)-total number of joins of paths and cycles (Q424617) (← links)
- On the vertex-arboricity of planar graphs without 7-cycles (Q442319) (← links)
- Planar graphs of maximum degree six without 7-cycles are class one (Q456339) (← links)
- Adjacent vertex distinguishing indices of planar graphs without 3-cycles (Q482220) (← links)
- Adjacent vertex distinguishing edge colorings of planar graphs with girth at least five (Q489739) (← links)
- The relationship between \(BS(H)\) and \(BS(G)\) (Q874782) (← links)
- A new sufficient condition for a toroidal graph to be 4-choosable (Q1660275) (← links)
- Planar graphs without chordal 6-cycles are 4-choosable (Q1752596) (← links)
- A note on the adjacent vertex distinguishing total chromatic number of graphs (Q1759396) (← links)
- Two sufficient conditions for a planar graph to be list vertex-2-arborable (Q2124649) (← links)
- Adjacent vertex distinguishing edge coloring of planar graphs without 4-cycles (Q2186285) (← links)
- List coloring and diagonal coloring for plane graphs of diameter two (Q2286099) (← links)
- On the vertex partition of planar graphs into forests with bounded degree (Q2294901) (← links)
- Neighbor sum distinguishing total colorings of planar graphs with maximum degree \(\varDelta\) (Q2352779) (← links)
- Planar graphs with \(\Delta =9\) are neighbor-distinguishing totally 12-colorable (Q2424665) (← links)
- The adjacent vertex distinguishing total coloring of planar graphs (Q2444142) (← links)
- Neighbor-distinguishing indices of planar graphs with maximum degree ten (Q2686132) (← links)
- (Q2824704) (← links)
- (Q2858736) (← links)
- (Q2864467) (← links)
- Vertex arboricity of planar graphs without chordal 6-cycles (Q2868169) (← links)
- (Q2987309) (← links)
- (Q3372634) (← links)
- A Characterization on the Adjacent Vertex Distinguishing Index of Planar Graphs with Large Maximum Degree (Q3461985) (← links)
- Legally $$(\varDelta +2)$$ ( Δ + 2 ) -Coloring Bipartite Outerplanar Graphs in Cubic Time (Q3467875) (← links)
- (Q4675749) (← links)
- DP-coloring on planar graphs without given adjacent short cycles (Q5012814) (← links)
- Adjacent vertex distinguishing total coloring of planar graphs with large maximum degree (Q5017728) (← links)
- (Q5037994) (← links)
- 不含带弦6-圈和项链图的平面图是DP-4-可染的 (Q5038381) (← links)
- Adjacent vertex distinguishing index of bipartite planar graphs (Q5063732) (← links)
- A local condition for planar graphs to be 4-choosable (Q5064122) (← links)
- (Q5129361) (← links)
- (Q5142839) (← links)
- On Neighbor-Distinguishing Index of Planar Graphs (Q5495886) (← links)
- Adjacent vertex distinguishing edge coloring of planar graphs without 3-cycles (Q5858150) (← links)
- Neighbor Sum Distinguishing Total Chromatic Number of Graphs with Lower Average Degree (Q6121343) (← links)
- (Q6123718) (← links)
- Variable degeneracy of planar graphs without chorded 6-cycles (Q6652636) (← links)
