|
F. Bazzaro, M. Montassier, A. Raspaud, (d; 1)-total labelling of planar graphs with large girth and high maximum degree, Discrete Math. 307 (2007) 2141-2151. O. V. Borodin, A. V. Kostochka, D. R. Woodall, Total colorings of planar graphs with large maximum degree, J. Graph Theory 26 (1996) 53-59. O. V. Borodin, A. V. Kostochka, D. R. Woodall, List edge and list total coloring of multigraphs, J. Combin. Theory Ser. B 71 (1997) 184-204. O. V. Borodin, A. V. Kostochka, D. R. Woodall, Total colorings of planar graphs with large girth, Europ. J. Combin. 19 (1998) 19-24. T. Calamoneri, L(h; k)-labeling problem: a survey and annotated bibliography, Comput. J. 54 (2011) 1344-1371. F. H. Chang, M. L. Chia, D. Kuo, S. C. Liaw, M. H. Tsai, L(2; 1)-labelings of subdivisions of graphs, Discrete Math. 338 (2015) 248-255. G. J. Chang and D. Kuo, The L(2; 1)-labeling on graphs, SIAM J. Discrete Math.9 (1996) 309-316. D. Chen,W.Wang, (2; 1)-total labelling of outerplanar graphs, Discrete Appl. Math.155 (2007) 2585-2593. D. Gonçalves. On the L(p; 1)-labelling of graphs, Discrete Mathematics and Theoretical Computer Science AE (2005) 81-86. J. R. Griggs, R. K. Yeh, Labelling graphs with a condition at distance 2, SIAM J.Discrete Math. 5 (1992) 586-595. F. Havet, M.-L. Yu, (p; 1)-total labelling of graphs, Technical Report 4650, INRIA,2002. F. Havet, M.-L. Yu, (p; 1)-total labelling of graphs, Discrete Math. 308 (2008) 496-513. S. Isobe, X. Zhou, T. Nishizeki, Total colorings of degenerated graphs, In ICALP 2001, LNCS 207b, 506-517, 2001. N. Karst, J. Ochrlein, D. S. Troxell, J. Zhu, L(d; 1)-labelings of the edge-path-replacement by factorization of graphs, J. Comb. Optim. 30 (2015) 34-41. K. W. Lih, D. D. -F. Liu, W. Wang, On (d; 1)-total numbers of graphs, Discrete Math. 309 (2009) 3767-3773. D. ü, L(2; 1)-labelings of the edge-path-replacement of a graph, J. Comb. Optim. 26 (2013) 385-392. D. ü, N. Lin, L(d; 1)-labelings of the edge-path-replacement of a graph, J. Comb. Optim. 26 (2013) 819-831. M. Montassier, A. Raspaud, (d; 1)-total labelling of graphs with a given maximum average degree, J. Graph Theory 51 (2006) 93-109. M. Rosenfeld, On the total coloring of certain graphs, Israel J. Math. 9 (1971) 396-402. N. Vijayadita, On total chromatic number of a graph, J. Lond. Math. Soc 3(2) (1971) 405-408. M. A. Whittlesey, J. P. Georges, D. W. Mauro, On the -number of Qn and related graphs, SIAM J. Discrete Math. 8 (1995) 499-506. H. P. Yap, Total Colourings of Graphs. Lecture Notes in Mathematics, vol. 1623, Springer, Berlin, 1996. R. K. Yeh, A survey on labeling graphs with a condition at distance two, Discrete Math. 306 (2006) 1217-1231. D. Kuo and J.-H. Yan, On L(2; 1)-labeling of Cartesian products of paths and cycles, Discrete Math. 283 (2004), 137-144. D. Lü and W. Lin, n-fold L(d; 1)-labelings of the edge-multiplicity-path-replacements, preprint. W. Lin and P. Zhang, On n-fold L(j; k)- and circular L(j; k)-labeling of graphs. Discrete Appl. Math., 160 (2012) 2452-2461. C. Schwarz and D. S. Troxell, L(2; 1)-labeling of products of two cycles, Discrete Appl. Math. 154 (2006), 1522-1540. H. Tang, n-fold-L(2; 1)-labelings of the edge-multiplicity-path-replacements, Ars Comb., 143 (2019) 13-28. R. K. Yeh, Pair L(2; 1)-labelings of in
nite graphs, Discuss. Math. Graph T., 39 (2019) 257-269. P. Zhang and W. Lin, Multiple L(j; 1)-labeling of the triangular lattice, J. Comb. Optim., 27 (2014) 695-710.
|