图的不可定向最大亏格

本文证明了:对于任何一个有圈连通图G,其不可定向最大亏格为这里,α₀,α₁分别为G的顶点和边的数目.从而,也解决了图的不可定向嵌入的存在性问题.     

The bondage number of graphs on topological surfaces and Teschner’s conjecture

The bondage number of a graph is the smallest number of its edges whose removal results in a graph having a larger domination number. We provide constant upper bounds for the bondage number of graphs on topological surfaces, and improve upper bounds for the bondage number in terms of the maximum vertex degree and the orientable and non-orientable genera of graphs. Also, we present stronger upper bounds for graphs with no triangles and graphs with the number of vertices larger than a certain threshold in terms of graph genera. This settles Teschner’s Conjecture in affirmative for almost all graphs. As an auxiliary result, we show tight lower bounds for the number of vertices of graphs 2-cell embeddable on topological surfaces of a given genus.     

一个不可定向曲面的极小禁用子图的构造

曲面S的一个极小禁用子图是这样的一个图,它的任何一个顶点的度都不小于3,它不能嵌入在S上,但是删去任何一条边后得到的图能嵌入在S上.本文给出了四种构造一个不可定向曲面的极小禁用子图的方式,即粘合一个顶点,一个图的边被其它的图替换,粘合两个顶点,将一个图放在另一个图的一个曲面嵌入的面内.     

不可定向曲面上的最大亏格嵌入和最小亏格嵌入

研究了不可定向曲面上最大亏格嵌入的估计数,得到了几类图的指数级不可定向最大亏格嵌入的估计数的下界.利用电流图理论,证明了完全图K_(12s)在不可定向曲面上至少有2~(3s-1)个最小亏格嵌入;完全图K_(12s+3)在不可定向曲面上至少有2~(2s)个最小亏格嵌入;完全图K_(12s+7)在不可定向曲面上至少有2~(2s+1)个最小亏格嵌入.     

The Semi-Arc Automorphism Group of a Graph with Application to Map Enumeration

A map is a connected topological graph cellularly embedded in a surface. For a given graph Γ, its genus distribution of rooted maps and embeddings on orientable and non-orientable surfaces are separately investigated by many researchers. By introducing the concept of a semi-arc automorphism group of a graph and classifying all its embeddings under the action of its semi-arc automorphism group, we find the relations between its genus distribution of rooted maps and genus distribution of embeddings on orientable and non-orientable surfaces, and give some new formulas for the number of rooted maps on a given orientable surface with underlying graph a bouquet of cycles B_n, a closed-end ladder L_n or a Ringel ladder R_n. A general scheme for enumerating unrooted maps on surfaces(orientable or non-orientable) with a given underlying graph is established. Using this scheme, we obtained the closed formulas for the numbers of non-isomorphic maps on orientable or non-orientable surfaces with an underlying bouquet B_n in this paper.     

On the genus of the semidirect product of ℤ9 by ℤ3

We show that the non-commutative semidirect product Γ of ?₉ by ?₃ has orientable genus 4. In other words, some Cayley graph of Γ embeds in an orientable surface of genus 4 (Euler characteristic ?6), but no Cayley graph of Γ embeds in an orientable surface of genus less than 4 (Euler characteristic greater than ?6). We also show that some Cayley graph of Γ embeds in a (non-orientable) surface of Euler characteristic ?3, but no Cayley graph of Γ embeds in a surface of Euler characteristic greater than ?3. Γ is the first known example of a group whose orientable Euler characteristic and non-orientable Euler characteristic differ by more than 1. Our results also complete the determination of the orientable genus of each group of order less than 32.     

A note on strong embeddings of maximal planar graphs on non-orientable sufraces

Abstract. In this paper, it is shown that for every maximal planar graph     

A characterization of the minimalbasis of the torus

D. König asks the interesting question in [7] whether there are facts corresponding to the theorem of Kuratowski which apply to closed orientable or non-orientable surfaces of any genus. Since then this problem has been solved only for the projective plane ([2], [3], [8]). In order to demonstrate that König’s question can be affirmed we shall first prove, that every minimal graph of the minimal basis of all graphs which cannot be embedded into the orientable surface f of genusp has orientable genusp+1 and non-orientable genusq with 1≦q≦2p+2. Then let f be the torus. We shall derive a characterization of all minimal graphs of the minimal basis with the nonorientable genusq=1 which are not embeddable into the torus. There will be two very important graphs signed withX ₈ andX ₇ later. Furthermore 19 graphsG ₁,G ₂, ...,G ₁₉ of the minimal basisM(torus, >₄) will be specified. We shall prove that five of them have non-orientable genusq=1, ten of them have non-orientable genusq=2 and four of them non-orientable genusq=3. Then we shall point out a method of determining graphs of the minimal basisM(torus, >₄) which are embeddable into the projective plane. Using the possibilities of embedding into the projective plane the results of [2] and [3] are necessary. This method will be called saturation method. Using the minimal basisM(projective plane, >₄) of [3] we shall at last develop a method of determining all graphs ofM(torus, >₄) which have non-orientable genusq≧2. Applying this method we shall succeed in characterizing all minimal graphs which are not embeddable into the torus. The importance of the saturation method will be shown by determining another graphG ₂₀≠G ₁,G ₂, ...,G ₁₉ ofM(torus, >₄).     

Total embedding distributions of Ringel ladders

The total embedding distributions of a graph consists of the orientable embeddings and non-orientable embeddings and are known for only a few classes of graphs. The orientable genus distribution of Ringel ladders is determined in [E.H. Tesar, Genus distribution of Ringel ladders, Discrete Mathematics 216 (2000) 235–252] by E.H. Tesar. In this paper, using the overlap matrix, we obtain nonhomogeneous recurrence relation for rank distribution polynomial, which can be solved by the Chebyshev polynomials of the second kind. The explicit formula for the number of non-orientable embeddings of Ringel ladders is obtained. Also, the orientable genus distribution of Ringel ladders is re-derived.     

Every connected,locally connected graph is upper embeddable

In this Note it is proved that every connected, locally connected graph is upper embeddable. Moreover, a lower bound for the maximum genus of the square of a connected graph is given.     

Genus embeddings for some complete tripartite graphs

The voltage graph construction of Gross is extended to the case where the base graph is non-orientably embedded. An easily applied criterion is established for determining the orientability character of the derived embedding. These methods are then applied to derive both orientable and non-orientable genus embeddings for some families of complete tripartite graphs.     

Local chromatic number of quadrangulations of surfaces

The local chromatic number of a graph G, as introduced in [4], is the minimum integer k such that G admits a proper coloring (with an arbitrary number of colors) in which the neighborhood of each vertex uses less than k colors. In [17] a connection of the local chromatic number to topological properties of (a box complex of) the graph was established and in [18] it was shown that a topological condition implying the usual chromatic number being at least four has the stronger consequence that the local chromatic number is also at least four. As a consequence one obtains a generalization of the following theorem of Youngs [19]: If a quadrangulation of the projective plane is not bipartite it has chromatic number four. The generalization states that in this case the local chromatic number is also four. Both papers [1] and [13] generalize Youngs’ result to arbitrary non-orientable surfaces replacing the condition of the graph being not bipartite by a more technical condition of an odd quadrangulation. This paper investigates when these general results are true for the local chromatic number instead of the chromatic number. Surprisingly, we find out that (unlike in the case of the chromatic number) this depends on the genus of the surface. For the non-orientable surfaces of genus at most four, the local chromatic number of any odd quadrangulation is at least four, but this is not true for non-orientable surfaces of genus 5 or higher. We also prove that face subdivisions of odd quadrangulations and Fisk triangulations of arbitrary surfaces exhibit the same behavior for the local chromatic number as they do for the usual chromatic number.     

关于图的平面嵌入的一个上可嵌入性

本文证明了一个无环图Ｇ如果能嵌人在平面上使得每个面的次不超过５,则Ｇ是上可嵌入的,即当曲面为Ｓ平面时,证明了Ｒ．Ｎｅｄｅｌａ和Ｍ．Ｓｋｏｖｉｅｒａ［１］所提猜想成立．     

The non-orientable genus of some metacyclic groups

We describe non-orientable, octagonal embeddings for certain 4-valent, bipartite Cayley graphs of finite metacyclic groups, and give a class of examples for which this embedding realizes the non-orientable genus of the group. This yields a construction of Cayley graphs for which is arbitrarily large, where and are the orientable genus and the non-orientable genus of the Cayley graph.Work supported in part by the Research Council of Slovenia, Yugoslavia and NSF Contract DMS-8717441.Supported by NSF Contract DMS-8601760.     

Graphs of given genus and arbitrarily large maximum genus

The maximum genus of a connected graph G is the maximum among the genera of all compact orientable 2-manifolds upon which G has 2-cell embeddings. In the theorems that follow the use of an edge-adding technique is combined with the well-known Edmonds' technique to produce the desired results. Planar graphs of arbitrarily large maximum genus are displayed in Theorem 1. Theorem 2 shows that the possibility for arbitrarily large difference between genus and maximum genus is not limited to planar graphs. In particular, we show that the wheel graph, the standard maximal planar graph, and the prism graph are upper embeddable. We then show that given m and n, there is a graph of genus n and maximum genus larger than mn.     

Thickness and outerthickness for embedded graphs

We prove new upper bounds for the thickness and outerthickness of a graph in terms of its orientable and nonorientable genus by applying the method of deleting spanning disks of embeddings to approximate the thickness and outerthickness. We also show that every non-planar toroidal graph can be edge partitioned into a planar graph and an outerplanar graph. This implies that the outerthickness of the torus (the maximum outerthickness of all toroidal graphs) is 3. Finally, we show that all graphs embeddable in the double torus have thickness at most 3 and outerthickness at most 5.     

Genus spectra for symmetric embeddings of graphs on surfaces

This paper gives an account of some very recent work by the author in determining all regular maps on surfaces of Euler characteristic −1 to −200 (orientable and non-orientable), observing patterns in the resulting data, and joint work with Jozef Siráň and Tom Tucker in proving the existence of infinitely many gaps in the genus spectrum of regular but chiral maps (on orientable surfaces) and the genus spectrum of reflexible regular maps on orientable surfaces with simple underlying graph.     

Counting Orientable Embeddings by Genus for a Type of 3-Regular Graph

On the basis of the joint tree model initiated in Liu (The non-orientable maximum genus of a graph (in Chinese), Scieulia Sinica, Special Issue on Math. I 191–201, 1979) and comprehensively described in Liu (Theory of Polyhedra (in English), Science Press, Beijing, 2008), this paper provides the numbers of topologically non-equivalent orientable embeddings of a new type of 3-regular graphs by genus via classifying the associate polyhegons.     

EMBEDDINGS OF ONE KIND OF GRAPHS

The purpose of this paper is to display a new kind of simple graphs which belong to B. inwhich any graph has its orientable genus n,n≥3. Furthermore, for any integer k,1≤k≤n,there exists a graph B^kn of B. such that the non-orientable genus of B^kn is k.     

广义置换图的最大亏格(英文)

In this paper we prove that the generalized permutation graph G(n,k) is upper embeddable if it has at most two odd subcycles,and that the maximum genus of G(n,k) is more than[β(G(n,k))/3]in most cases.