摘要
不含三角形子图是简化图的一个重要特征.在研究超欧拉图的边数问题中,估计子图的边数是一个有趣的问题.在考察不含三角形子图这一类图时,使用移边法发现了一个估计这类图的边数的一个上界,并且得到了在达到这个上界时,该图所具有的结构.
K 3-free is an important property of reduced graphs.In studying supereulerian graphs,estimating edge-number is a very interesting problem.In this paper,one upper bound of edge-number of graphs with K 3-free has been found by the method of edge-transition.In addition,the structure of the graph has also been obtained when the upper bound is being reached.
出处
《重庆工商大学学报（自然科学版）》
2007年第1期1-2,共2页
Journal of Chongqing Technology and Business University:Natural Science Edition
关键词
不含三角形图
边数
移边法
简化图
超欧拉图
K 3-free
edge number
edge-transition
reduced graph
supereulerian
