临界2-连通图的构造A METHOD OF CONSTRUCTION CRITI CALLY OF 2-CONNECTED GRAPHS
郭晓峰;朱必文;
摘要(Abstract):
对于无重边的2-连通图和临界2-连通图,本文定义了2-连通可约链和临界2-连通可约链的概念,给出了它们的数目的下界;进而给出了临界2-连通图的递归构造方法。
关键词(KeyWords):
基金项目(Foundation):
作者(Authors): 郭晓峰;朱必文;
参考文献(References):
- [1] B. Bollobas, Extremal Graph Theory, Academic Press Inv.(London) LTD,1978.
- [2] G. Chary, M.Chein, Minimally 2-edge Connected Graphs, J. Graph Theory, Vol. 3 (1979) , 15-22.
- [3] G.A.Dirae, Minimally 2-Connected Graphs, J. Reine Angew Math., 228 (1967) , 204-216.
- [4] Tian Feng, Zhang Cunquan, The Maximum Size of a Critically 2-edge-connected Graph, J.Sys. Sci & Math.Scis, 3 (1) (1983) , 55-61.
- [5] 张福楚、陈荣斯,两类临界2-棱连通图,应用数学学报,vol.8,No.2(1985) 227-234.
- [6] 朱必文,极小2-棱-连通图的若干性质,数学学报,Vol.24,No.3(1981) ,436-443.
- [7] 朱必文,临界2-棱-连通图,应用数学学报,Vol.6,No.3(1983) ,262-301.
- [8] 丁颂康,最大临界2-边-连通图的结构,中国图论研究会第三次学术讨论会资料.