Weifan Wang

Labeling Planar Graphs with Conditions on Girth and Distance Two

For a planar graph

Choosability and Edge Choosability of Planar Graphs without Five Cycles

G

Coloring the square of a K 4 -minor free graph

, let

The L(2,1)-labelling of trees

\Delta(G)

Relaxed game chromatic number of graphs

,

A note on list improper coloring planar graphs

g(G)

Choosability and Edge Choosability of Planar Graphs without Intersecting Triangles

, and

Note: The L(2,1)-labelling of trees

\lambda(G;p,q)

Adjacent vertex-distinguishing edge colorings of K"4-minor free graphs

denote, respectively, its maximum degree, girth, and

On Neighbor-Distinguishing Index of Planar Graphs

L(p,q)