Aijun Dong

most citedEquitable Coloring and Equitable Choosability of Planar Graphs without chordal 4- and 6-Cycles

3 citations · 3 across the 1 of their papers we have counts for

collaborators

2 papers

math.CO2020

Neighbor product distinguishing total colorings of corona of subcubic graphs

Aijun Dong, Wenwen Zhang

A proper $[k]$ -total coloring $c$ of a graph $G$ is a mapping $c$ from $V (G) ⋃ E (G)$ to $[k] = {1, 2, \dots, k}$ such that $c (x) \neq = c (y)$ for which $x$ , $y \in V (G) ⋃ E (G)$ …

math.CO2018★ 3 cited

Equitable Coloring and Equitable Choosability of Planar Graphs without chordal 4- and 6-Cycles

Aijun Dong, Jianliang Wu

A graph $G$ is equitably $k$ -choosable if, for any given $k$ -uniform list assignment $L$ , $G$ is $L$ -colorable and each color appears on at most $⌈ \frac{∣ V ( G ) ∣}{k} ⌉$ vert…