The present paper studies the following variation of vertex coloring on graphs. A graph G is
equitably k-colorable if there is a mapping f: V (G)→{1, 2,…, k} such that f (x)≠ f (y) for xy∈ E …

For a positive integer k, a graph G is equitably k-colorable if there is a mapping f: V (G)→{1,
2,…, k} such that f (x)≠ f (y) whenever xy∈ E (G) and|| f− 1 (i)|−| f− 1 (j)||≤ 1 for 1≤ i< j≤ k …

A proper vertex coloring of a graph is equitable if the sizes of color classes differ by at most
1. The equitable chromatic number of a graph G, denoted by χ=(G), is the minimum k such …

Gallian in 2007 gave the construction of the prism by considering the cartesian product of
the cycle and the path. The generalized Petersen graph was introduced in 1950 by Coxeter …

A proper vertex coloring of a graph is equitable if the sizes of color classes differ by at most
one. The equitable chromatic number of a graph $ G $, denoted by $\chi_=(G) $, is the …

Equitable Colorings of Cartesian Product Graphs of Wheels with Complete Bipartite Graphs
Page 1 Equitable Colorings of Cartesian Product Graphs of Wheels with Complete Bipartite …

Let r and k be positive integers. A graph G is r-equitably k-colorable if its vertex set can be
partitioned into k independent sets, any two of which differ in size by at most r. The r …

Let G be a connected and undirected graph. Vertex coloring in a graph G is a mapping from
the set of vertices in G to the set of colors such that every two adjacent vertices have different …

For a positive integer $ k $, if we can color all vertices of $ G $ in $ k $ colors such that the
colors of two adjacent vertices are different, and any two color classes are different in size at …

91 EQUITABLE COLORINGS OF CARTESIAN PRODUCTS OF FANS WITH BIPARTITE
GRAPHS1 Liancui Zuo2 Fanglan Wu Shaoqiang Zhang 2. Introduct Page 1 italian journal of …