标题:On (p, 1)-total labelling of 1-planar graphs
作者:Zhang, Xin; Yu, Yong; Liu, Guizhen
作者机构:[Zhang, Xin; Yu, Yong; Liu, Guizhen] Shandong Univ, Sch Math, Jinan 250100, Peoples R China.
通讯作者:Zhang, X
通讯作者地址:[Zhang, X]Shandong Univ, Sch Math, 27 Shan Da Nan Rd, Jinan 250100, Peoples R China.
来源:CENTRAL EUROPEAN JOURNAL OF MATHEMATICS
出版年:2011
卷:9
期:6
页码:1424-1434
DOI:10.2478/s11533-011-0092-1
关键词:1-planar graph; Alternating subgraph; Master; Total labelling;; Discharging
摘要:A graph is 1-planar if it can be drawn on the plane so that each edge is crossed by at most one other edge. In this paper, it is proved that the (p, 1)-total labelling number of every 1-planar graph G is at most Delta(G) + 2p - 2 provided that Delta(G) >= 8p + 4 or Delta(G) >= 6p + 2 and g(G) >= 4. As a consequence, the well-known (p, 1)-total labelling conjecture has been confirmed for some 1-planar graphs.
收录类别:SCOPUS;SCIE
WOS核心被引频次:10
Scopus被引频次:9
资源类型:期刊论文
原文链接:https://www.scopus.com/inward/record.uri?eid=2-s2.0-80053107852&doi=10.2478%2fs11533-011-0092-1&partnerID=40&md5=76c8590d8d1ca3db404f3265d9fa1837
TOP