Fundamental cycles and graph embeddings

作     者：REN Han ZHAO HongTao LI HaoLing 

作者机构：Department of MathematicsEast China Normal UniversityShanghai 200062China 

出 版 物：《Science China Mathematics》 (中国科学：数学（英文版）)

年 卷 期：2009年第52卷第9期

页      面：1920-1926页

核心收录：

学科分类：07[理学] 070104[理学-应用数学] 0701[理学-数学] 

基　　金：supported by National Natural Science Foundation of China (Grant Nos.10271048,10671073) Science and Technology Commission of Shanghai Municipality (Grant No.07XD14011) Shanghai Leading Discipline Project (Project No.B407) 

主　　题：fundamental cycle maximum genus upper-embedded 05C10 05C70 

摘      要：In this paper, we investigate fundamental cycles in a graph G and their relations with graph embeddings. We show that a graph G may be embedded in an orientable surface with genus at least g if and only if for any spanning tree T, there exists a sequence of fundamental cycles C 1,C 2,…,C 2g with C 2i?1 ∩ C 2i ≠ /0 for 1 ? i ? g. In particular, among β(G) fundamental cycles of any spanning tree T of a graph G, there are exactly 2γM (G) cycles C 1, C 2,…,C 2γM(G) such that C 2i?1 ∩ C 2i ≠ /0 for 1 ? i ? γM (G), where β(G) and γM (G) are the Betti number and the maximum genus of G, respectively. This implies that it is possible to construct an orientable embedding with large genus of a graph G from an arbitrary spanning tree T (which may have very large number of odd components in G E(T)). This is different from the earlier work of Xuong and Liu, where spanning trees with small odd components are needed. In fact, this makes a common generalization of Xuong, Liu and Fu et al. Furthermore, we show that (1) this result is useful for locating the maximum genus of a graph having a specific edge-cut. Some known results for embedded graphs are also concluded; (2) the maximum genus problem may be reduced to the maximum matching problem. Based on this result and the algorithm of Micali-Vazirani, we present a new efficient algorithm to determine the maximum genus of a graph in $ O((\beta (G))^{\frac{5} {2}} ) $ steps. Our method is straight and quite different from the algorithm of Furst, Gross and McGeoch which depends on a result of Giles where matroid parity method is needed.