On equitable Δ-coloring of graphs with low average degree
Theoretical Computer Science - Graph colorings
An Ore-type theorem on equitable coloring
Journal of Combinatorial Theory Series B
The equitable total chromatic number of the graph HM(Wn)
Journal of Applied Mathematics and Computing
Equitable list colorings of planar graphs without short cycles
Theoretical Computer Science
Ore-type versions of Brooks' theorem
Journal of Combinatorial Theory Series B
Equitable colorings of Kronecker products of graphs
Discrete Applied Mathematics
Note: Equitable and equitable list colorings of graphs
Theoretical Computer Science
Equitable colorings of Cartesian products of graphs
Discrete Applied Mathematics
Every 4-Colorable Graph With Maximum Degree 4 Has an Equitable 4-Coloring
Journal of Graph Theory
Equitable colorings of planar graphs without short cycles
Theoretical Computer Science
| Hi-index | 0.00 |