Circular total chromatic numbers of graphs

$$L(j,k)$$ L ( j , k ) -labeling number of Cartesian product of path and cycle

“…L( j, k)-labeling numbers of graphs were studied in many articles, please refer to Calamoneri (2006); Jin (2007, 2005); Lam et al (2007); Liu (2001Liu ( , 2003; Zhu (2003, 2005); Mohar (2003); Yeh (2006); Zhu (2001) for j ≥ k and Bertossi and Bonuccelli (1995); Calamoneri et al (2006); Lin and Wu (2009) ;Jin and Yeh (2004); Niu (2007); Shiu and Wu (2013); Wu and Lin (2010); Wu et al (2014) for j ≤ k.…”