Abstract: Let G denote a finite simple graph,and set p=|V(G)|,f=min{d(u)+d(v)|u、v∈V(G),uv∈E(G)}, If f<p, G is called an Ore-type graph. This paper gives a classification of three-connected Ore-type graphes and also the lower bound of the length of the longest circle which contains whichever edge of the graph.

摘要： 令G表示有限简单图,p=|V(G)|,f=min{d(u)+d(v)|u、v∈V(G),uv∈E(G)}。若f<p,G称为Ore型图。本文对3-连通Ore型图作了一个分类,给出了其中任一边所在的最长圈的长度的下界。