Colorings of Generalized Mycielskians of Graphs

Wensong Lin
Department of Mathematics, Southeast University, Nanjing 210096, P. R. China

Abstract     Full Text  PDF

Given a graph $G$ and any integer $m$, one can transform $G$ into a new graph $\mu_m(G)$, the generalized Mycielskian of $G$. In this talk, we discuss circular coloring and $k$-tuple coloring of generalized Mycielskians of certain classes of graphs.