关于超欧拉图的一个注记

设G是无向无环的有限图 ,若G有一个生成子图是欧拉图 (Euler) ,则称G是超欧拉图 (Supereulerian) .本文不利用收缩方法 ,直接证明了 :当图G至多差一边有两棵边不相交的生成树时 ,G是超欧拉图或者G有割边 .     

含有欧拉生成子图的3边连通图

本文所讨论的图均为无向、有限简单图。文中没有指明的记号、术语见[3]。图G的欧拉生成子图是一条经过G的所有顶点的闭迹,以下简称S-闭迹。     

5连通图中的可去边

An edge e of a k-connected graph G is said to be a removable edge if G O e is still k-connected, where G e denotes the graph obtained from G by deleting e to get G - e, and for any end vertex of e with degree k - 1 in G- e, say x, delete x, and then add edges between any pair of non-adjacent vertices in NG-e （x）. The existence of removable edges of k-connected graphs and some properties of 3-connected and 4-connected graphs have been investigated [1, 11, 14, 15]. In the present paper, we investigate some properties of 5-connected graphs and study the distribution of removable edges on a cycle and a spanning tree in a 5- connected graph. Based on the properties, we proved that for a 5-connected graph G of order at least 10, if the edge-vertex-atom of G contains at least three vertices, then G has at least （3│G│ ＋ 2）/2 removable edges.     

3连通图的可去边数

设 e是 3连通图 G的一条边 ,如果 G- e是某个 3连通图的剖分 ,则称 e是 G的可去边 .本文给出了 3连通图的可去边数依赖于极大半轮的下界以及达到下界的极图 .     

上连通和超连通三次点传递图(英)

图G称为上连通的,若对每个最小割集C,G-C有孤立点.G称为超连通的,若对每个最小割集G,G-C恰有两个连通分支,且其中之一为孤立点.本文刻划了上连通和超连通三次点传递图.     

图是超限制性边连通的充分条件

设G=（V,E）是连通图.边集S E是一个限制性边割,如果G-S是不连通的且G—S的每个分支至少有两个点.G的限制性连通度λ＇（G）是G的一个最小限制性边割的基数.G是λ＇-连通的,如果G存在限制性边割.G是λ＇-最优的,如果λ＇（G）=ζ（G）,其中ζ（G）是min{d（x）＋d（y）-2：xy是G的一条边}.进一步,如果每个最小的限制性边割都孤立一条边,则称G是超限制性边连通的或是超-λ＇.G的逆度R（G）=∑_（v∈V） 1/d（v）,其中d（v）是点v的度数.我们证明了G是λ＇-连通的且不含三角形,如果R（G）≤2＋1/ζ-ζ/（（2δ-2）（2δ-3））＋（n-2δ-ζ＋2）/（（n-2δ＋1）（n-2δ＋2））,则G是超-λ＇.     

极小k边连通图的一个极值问题

本文只讨论单纯图。所有符号的意义均同于[2]。依照[1]给出定义 如图 G=(V,E)具有性质:λ(G)=k,而对(?)e∈E 均有λ(G-e)=k-1,则称 G 为极小 k 边连通图。设已给图 G=(V,E),如果 A,B(?)V,且 A∩B=φ,则记[A,B]={xy↓x∈A,y∈B,xy∈E}。如果 S(?)E,|S|=k,且 G-S=G_1 U G_2 V(G_1)∩V(G_2)=φ,V(G_1)≠φ,     

连通的欧拉生成子图

本文证明了:若 G 是一个 p 个顶点的、2-边-连通简单图,其边数,q≥((p-4)/2)+7.则除 K_(2,5)外,G 有连通的欧拉生成子图.当 q=((p-4)/4)+6和 k(G)=2时,本文给出了全部6个极图.     

连通的欧拉生成子图

本文证明了：若G是一个p顶点的、2－边－连通简单图，其边数，q≥(p-4↑ 2) 7，则除K2，5外，G有连通的欧拉生成子图。当q=(p-r↑ 2）＋6和κ′（G）＝2时，本文给出了全部6个极图。     

On 3-Edge-Connected Supereulerian Graphs

The supereulerian graph problem, raised by Boesch et al. (J Graph Theory 1:79–84, 1977), asks when a graph has a spanning eulerian subgraph. Pulleyblank showed that such a decision problem, even when restricted to planar graphs, is NP-complete. Jaeger and Catlin independently showed that every 4-edge-connected graph has a spanning eulerian subgraph. In 1992, Zhan showed that every 3-edge-connected, essentially 7-edge-connected graph has a spanning eulerian subgraph. It was conjectured in 1995 that every 3-edge-connected, essentially 5-edge-connected graph has a spanning eulerian subgraph. In this paper, we show that if G is a 3-edge-connected, essentially 4-edge-connected graph and if for every pair of adjacent vertices u and v, d _G (u) + d _G (v) ≥ 9, then G has a spanning eulerian subgraph.     

最小次数至少为4的超欧拉图

设Ｇ是２－边－连通的ｎ阶图。假设对任何的的最小边割集Ｅ等于包含于Ｅ（Ｇ）且│Ｅ│≤３,Ｇ－Ｅ的每个分支的阶至少为ｎ／５,则或者Ｇ是一个超欧拉图或者Ｇ有５个互不相交的阶数为ｎ／５连通分支,当这５个分支都收缩时,Ｇ收缩为Ｋ２,３,这个结果推广了蔡小涛,Ｐ．Ａ．Ｃａｔｌｉｎ,Ｆ．Ｊａｅｇｅｒ和Ｈ．Ｊ．Ｌａｉ等人关于超欧拉图的结果。     

关于Hamilton3-正则2-连通平面图的一个注记

设Fk*是满足以下条件的3-正则2-连通平面图G所组成的图类,在G中存在这样的圈C,使得G-E(C)产生k个不相交的树T1,…,Tk(|E(Ti)|≥3,i=1,…,k),且这些树是按C的指定方向C*依次粘在圈C上的．本文主要证明了如下结果:Fk*中的图都是Hamilton的．     

单圈图的零度的一个注记

The number of zero eigenvalues in the spectrum of the graph G is called its nullity and is denoted by η(G).In this paper,we determine the all extremal unicyclic graphs achieving the fifth upper bound n-6 and the sixth upperbound n-7.     

A Note on Cycle Lengths in Graphs

 We prove that for every c>0 there exists a constant K = K(c) such that every graph G with n vertices and minimum degree at least c n contains a cycle of length t for every even t in the interval [4,e c(G) − K] and every odd t in the interval [K,o c(G) − K], where e c(G) and o c(G) denote the length of the longest even cycle in G and the longest odd cycle in G respectively. We also give a rough estimate of the magnitude of K. Received: July 5, 2000 Final version received: April 17, 2002 2000 Mathematics Subject Classification. 05C38     

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

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.     

关于完全多部图的带宽和的一个注记

本文得到完全多部图的带宽和的一个递推方程；并由此给出带宽和的一些精确值．     

关于完全三部图色唯一性的一个注记

Let P(G,λ) be the chromatic polynomial of a simple graph G. A graph G is chromatically unique if for any simple graph H, P(H,λ) = P(G,λ) implies that H is isomorphic to G. Many sufficient conditions guaranteeing that some certain complete tripartite graphs are chromatically unique were obtained by many scholars. Especially, in 2003, Zou Hui-wen showed that if n 31m2 + 31k2 + 31mk+ 31m? 31k+ 32√m2 + k2 + mk, where n,k and m are non-negative integers, then the complete tripartite graph K(n - m,n,n + k) is chromatically unique (or simply χ-unique). In this paper, we prove that for any non-negative integers n,m and k, where m ≥ 2 and k ≥ 0, if n ≥ 31m2 + 31k2 + 31mk + 31m - 31k + 43, then the complete tripartite graph K(n - m,n,n + k) is χ-unique, which is an improvement on Zou Hui-wen's result in the case m ≥ 2 and k ≥ 0. Furthermore, we present a related conjecture.