标题:Light Subgraphs in the Family of 1-Planar Graphs with High Minimum Degree
作者:Xin ZHANG;Gui Zhen LIU;Jian Liang WU;
作者机构:[Xin ZHANG;Gui Zhen LIU;Jian Liang WU]School of Mathematics, Shandong University
通讯作者:Zhang, X(sdu.zhang@yahoo.com.cn)
通讯作者地址:[Zhang, X]Shandong Univ, Sch Math, Jinan 250100, Peoples R China.
来源:Acta Mathematica Sinica
出版年:2012
卷:28
期:6
页码:1155-1168
DOI:10.1007/s10114-011-0439-3
关键词:1-Planar graph; lightness; height; discharging
摘要:A graph is 1-planar if it can be drawn in the plane so that each edge is crossed by at most one other edge. In this paper, it is shown that each 1-planar graph with minimum degree 7 contains a copy of K2∨(K1∪K2) with all vertices of degree at most 12. In addition, we also prove the existence of a gr...
收录类别:CSCD;SCOPUS;SCIE
WOS核心被引频次:6
Scopus被引频次:6
资源类型:期刊论文
原文链接:http://kns.cnki.net/kns/detail/detail.aspx?FileName=ACMS201206006&DbName=CJFQ2012
TOP