| A NEW SUFFICIENT CONDITION FOR S-CIRCUITS IN GRAPHS |
| |
| 作者姓名： | 臧文安 田丰 |
| |
| 作者单位： | Institute of Systems Science Academia Sinica，Beijing，China，Institute of Systems Science，Academia Sinica，Beijing，China |
| |
| 基金项目： | The present work is supported by the National Natural Science Foundation of China |
| |
| 摘 要： | In1],P.Paulraja posed the following problem:Let G be a 2-connected graph suchthat δ(G)≥3,where δ(G)denotes the minimum degree of G.If each edge of G lies on either a cycle oflength 3 or a cycle of length 4,is it true that G has a spanning Eulerian subgraph?A related case inwhich δ(G)≥4 is settled affairmatively in this paper.
|
A NEW SUFFICIENT CONDITION FOR S-CIRCUITS IN GRAPHS |
| |
| Zang Wenan Tian Feng.A NEW SUFFICIENT CONDITION FOR S-CIRCUITS IN GRAPHS[J].Journal of Systems Science and Complexity,1989(3). |
| |
| Authors: | Zang Wenan Tian Feng |
| |
| Abstract: | |
| |
| Keywords: | 2-connected graph Spanning Eulerian subgraph |
| 本文献已被 CNKI 等数据库收录！ |
