1-平面图的线性荫度.docVIP

1-平面图的线性荫度 张欣，刘桂真，吴建良 山东大学数学学院，济南　 250100 摘要：如果一个图可以画在平面上使得其中的每条边被其他边交叉最多一次，则称该图是 1-平 面图。如果一个森林的每个分支都是路，则称该森林为线性森林。一个图 G 的线性荫度 la(G) 是 G 可以边分解为线性森林的最小个数。关于图的线性荫度，Akiyama, Exoo 与 Harary 猜想 ? ?(2G)? ≤ la(G) ≤ ? ?(G2)+1? 对每个图 G 都成立。本文证明了最大度 ? ≥ 33 的 1-平面图的线 性荫度恰好为 ??/2? 关键词：1-平面图，1-嵌入图，线性荫度 中图分类号： O157.5 On the linear arboricity of 1-planar graphs ZHANG Xin, LIU Guizhen, WU Jian-Liang School of Mathematics, Shandong University, Jinan 250100 Abstract: A graph is 1-planar if it can be drawn on a plane so that each edge is crossed by at most one other edge. A linear forest is a forest in which every connected component is a path. The linear arboricity la(G) of a graph G is the minimum number of linear forests in G, whose union is the set of all edges of G. Akiyama, Exoo and Harary conjectured that ? ?(2G)? ≤ la(G) ≤ ? ?(G2)+1? for any graph G. In this paper, we prove that the linear arboricity of every 1-planar graph with maximum degree ? ≥ 33 is exactly ??/2? Key words: 1-planar graph, 1-embedded graph, linear arboricity 0 Introduction All graphs considered here are ?nite, simple and undirected. Most of the notions are standard and we refer the readers to [1]. A linear forest is a forest in which every connected component is a path. The linear arboricity la(G) of a graph G is the minimum number of linear forests in G, whose union is the set of all edges of G. Akiyama, Exoo and Harary [2] conjectured that la(G) = ?(?(G) + 1)/2? for any regular graph G. It is obviously that la(G) ≥ ??(G)/2? for every graph G and la(G) ≥ ?(?(G) + 1)/2? for every regular graph G. So this conjecture is equivalent to the following conjecture. Conjecture 1. For any graph G, ? ?(2G)? ≤ la(G) ≤ ? ?(G2)+1?. Foundations： National Natural Science Foundation of China , Research Fund for the Doctoral Program of Higher Education (200804220001, 20100131120017), Graduate Independent Innovation Foundation of Shandong University (yzc10040), Chinese Ministry of Education Prize