| 关于图的圈覆盖 |
| |
| 引用本文： | 刘建农. 关于图的圈覆盖[J]. 青岛大学学报(自然科学版), 1994, 7(1): 44-48 |
| |
| 作者姓名： | 刘建农 |
| |
| 作者单位： | 山东经济学院 |
| |
| 摘 要： | Ａ．Ｉｔａｌ和Ｍ．Ｒｏｄｅｈ给出了两个关于图的圈覆盖的猜想：（ｉ）任意２－边连通图Ｇ＝（Ｖ，Ｅ）有困覆盖Ｃ，使ｌ（Ｃ）≤｜Ｅ｜＋｜Ｖ｜－１；（ｎ）任意２－边连通图有困覆盖，使图的每条边至多被覆盖两次．本文证明了猜想对平面图和２－边连通没有３－边割的图成立，并给出了一与两猜想等价的条件．同时也对著名的２－圈覆盖猜想作了讨论．
|
| 关 键 词： | 圈覆盖；欧拉子图；平面图 |
ON THE CYCLE-COVERING OF GRAPHS |
| |
| Liu Jiannong. ON THE CYCLE-COVERING OF GRAPHS[J]. Journal of Qingdao University(Natural Science Edition), 1994, 7(1): 44-48 |
| |
| Authors: | Liu Jiannong |
| |
| Abstract: | . Ital and M. Rodeh gave two conjectures about Cycle---- Covering: (i) every 2 edge connected graph has a cycle cover C. such that,; (ii) every 2-- edge connected graph has a cycle cover, with which every edge is covered at most twice. This paper proves that the conjectures are hold for planar graphs and 2--edgeconnected graphs without 3 -- edge cut and gives a condition equivalent to the conjectures. Meanwhile,this paper discusses the famous 2--Cycle Covering Conjecture. |
| |
| Keywords: | ycle covering Eulerian subgraph planar graph |
| 本文献已被 CNKI 维普 等数据库收录！ |
