Total coloring of graphs embedded in surfaces of nonnegative Euler characteristic

Let G be a graph which can be embedded in a surface of nonnegative Euler characteristic.In this paper,it is proved that the total chromatic number of G is △(G)+1 if △(G)9,where △(G)is the maximum degree of G.     

The Entire Coloring of Series-Parallel Graphs

The entire chromatic number X_(vef)(G) of a plane graph G is the minimal number of colors needed for coloring vertices, edges and faces of G such that no two adjacent or incident elements are of the same color. Let G be a series-parallel plane graph, that is, a plane graph which contains no subgraphs homeomorphic to K_(4-) It is proved in this paper that X_(vef)(G)≤max{8, △(G) 2} and X_(vef)(G)=△ 1 if G is 2-connected and △(G)≥6.     

Improved upper bounds on acyclic edge colorings

An acyclic edge coloring of a graph is a proper edge coloring such that every cycle contains edges of at least three distinct colors.The acyclic chromatic index of a graph G,denoted by a′(G),is the minimum number k such that there is an acyclic edge coloring using k colors.It is known that a′(G)≤16△for every graph G where △denotes the maximum degree of G.We prove that a′(G)13.8△for an arbitrary graph G.We also reduce the upper bounds of a′(G)to 9.8△and 9△with girth 5 and 7,respectively.     

Multivariate discriminant and iterated resultant

In this paper,we study the relationship between iterated resultant and multivariate discriminant.We show that,for generic form f(x_n) with even degree d,if the polynomial is squarefreed after each iteration,the multivariate discriminant △(f) is a factor of the squarefreed iterated resultant.In fact,we find a factor Hp(f,[x_1,...,x_n]) of the squarefreed iterated resultant,and prove that the multivariate discriminant △(f) is a factor of Hp(f,[x_1,...,x_n]).Moreover,we conjecture that Hp(f,[x_1,...,x_n]) = △(f) holds for generic form/,and show that it is true for generic trivariate form f(x,y,z).     

Edge choosability of planar graphs without short cycles

In this paper we prove that if G is a planar graph with △= 5 and without 4-cycles or 6-cycles, then G is edge-6-choosable. This consequence together with known results show that, for each fixed k ∈{3,4,5,6}, a k-cycle-free planar graph G is edge-(△ 1)-choosable, where △ denotes the maximum degree of G.     

Fixed Point Theorems for Mappings in Compact Menger Space

Suppose that (X,△)is a Menger space, t-norm ⊿ satisfies sup x<1 ⊿(x,a)=a for all a∈[0, 1]. From the remark in [1, p. 330] we know that (X, ⊿) is a Hausdorff space in the topology induced by the family of neighborhoods     

ON THE DIFFERENCE COUNTERPART OF BRCK'S CONJECTURE

In this article, for a transcendental entire function f(z) of finite order which has a finite Borel exceptional value α, we utilize properties of complex difference equations to prove the difference counterpart of Br¨uck's conjecture, that is, if △f(z) = f(z + η)- f(z)and f(z) share one value a(≠α) CM, where η∈ C is a constant such that f(z + η) ≡ f(z),then△f(z)- a/f(z)- a=a/a-α.     

On the equivalence of extremal Teichmller mapping

Let T(△) and B(△) be the Teichmuller space and the infinitesimal Teichmuller space of the unit disk △ respectively. In this paper, we show that [ν]B(△) being an infinitesimal Strebel point does not imply that [ν]T(△) is a Strebel point, vice versa. As an application of our results, problems proposed by Yao are solved.     

关于图的星色数的一点注记

A star coloring of an undirected graph G is a proper coloring of G such that no path of length 3 in G is bicolored.The star chromatic number of an undirected graph G,denoted by χs(G),is the smallest integer k for which G admits a star coloring with k colors.In this paper,we show that if G is a graph with maximum degree △,then χs(G) ≤ [7△3/2],which gets better bound than those of Fertin,Raspaud and Reed.     

Biharmonic equations with asymptotically linear nonlinearities

This article considers the equation △2u = f(x, u)with boundary conditions either u|(a)Ω = (a)u/(a)n|(a)Ω = 0 or u|(a)Ω = △u|(a)Ω = 0, where f(x,t) is asymptotically linear with respect to t at infinity, and Ω is a smooth bounded domain in RN, N ＞ 4. By a variant version of Mountain Pass Theorem, it is proved that the above problems have a nontrivial solution under suitable assumptions of f(x, t).