Light chordal 4-cycle in IC-planar graphs with degree restrictions

Computer Engineering and Applications ›› 2016, Vol. 52 ›› Issue (20): 26-28.

Previous Articles Next Articles

Light chordal 4-cycle in IC-planar graphs with degree restrictions

TIAN Jingjing1，2, NIE Yufeng1

1.Derpartment of Applied Mathematics, School of Natural and Applied Sciences, Northwestern Polytechnical University, Xi’an 710129, China
2.School of Mathematics and Computer Science, Shaanxi University of Technology, Hanzhong, Shaanxi 723000, China

Online:2016-10-15 Published:2016-10-14

度限制条件下的IC平面图类中轻弦4-圈的存在性

田京京1，2，聂玉峰1

1.西北工业大学理学院应用数学系，西安 710129
2.陕西理工大学数学与计算机科学学院，陕西汉中 723000

Abstract

Abstract: It is proved by discharging method that every IC-planar graph with minimum vertex degree at least 5 and minimum edge degree at least 11 contains a chordal 4-cycle with maximum degree at most 11.

Key words: IC-planar graph, discharging method, lightness, chordal 4-cycle

摘要： 利用权转移方法证明每个最小度至少为5并且最小边度至少为11的IC-平面图含有一个最大度至多为11的弦4-圈。

关键词: IC-平面图, 权转移, 轻, 弦4-圈

TIAN Jingjing1，2, NIE Yufeng1. Light chordal 4-cycle in IC-planar graphs with degree restrictions[J]. Computer Engineering and Applications, 2016, 52(20): 26-28.

田京京1，2，聂玉峰1. 度限制条件下的IC平面图类中轻弦4-圈的存在性[J]. 计算机工程与应用, 2016, 52(20): 26-28.

Light chordal 4-cycle in IC-planar graphs with degree restrictions

度限制条件下的IC平面图类中轻弦4-圈的存在性

PDF

Knowledge

Abstract

Cite this article

share this article

References

Related Articles 1

Recommended Articles

Metrics