(2,1)-total labelling of planar graphs with large maximum degree-Reference-Cited by-同舟云学术

(2,1)-total labelling of planar graphs with large maximum degree

Published:2017-11-17 Issue:8 Volume:20 Page:1625-1636
ISSN:0972-0529
Container-title:Journal of Discrete Mathematical Sciences and Cryptography
language:en
Short-container-title:Journal of Discrete Mathematical Sciences and Cryptography

Author:

Yu Yong¹,Zhang Xin²,Wang Guanghui¹,Liu Guizhen¹,Li Jinbo³

Affiliation:

1. School of Mathematics, Shandong University, Jinan, Shandong 250100, P. R. China

2. School of Mathematics and Statistics, Xidian University, Xi’an, Shaanxi 710071, P. R. China

3. College of Sciences, China University of Mining and Technology, Xuzhou, Jiangsu 221116, P. R. China

Publisher

Informa UK Limited

Subject

Applied Mathematics,Algebra and Number Theory,Analysis

Link

Reference7 articles.

Cited by 4 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

2. 1-planar Graphs without 4-cycles or 5-cycles are 5-colorable;Acta Mathematicae Applicatae Sinica, English Series;2022-01

4. Two results on K-(2,1)-total choosability of planar graphs;Discrete Mathematics, Algorithms and Applications;2020-07-30