The edge chromatic number of outer-1-planar graphs

A graph is outer-1-planar if it can be drawn in the plane so that all vertices are on the outer face and each edge is crossed at most once. In this paper, we completely determine the edge chromatic number of outer 1-planar graphs

An upper bound for the equitable chromatic number of complete n-partite graphs

A proper vertex coloring of a graph $G$ is equitable if the size of color classes differ by at most one. The equitable chromatic number of $G$ is the smallest integer $m$ such that $G$ is equitable m-colorable. In this paper, we derive an upper bound for the equitable chromatic number of complete n-partite graph $K_{p_{1},p_{2}, ... ,p_{n}}$