| 通往图的双圈覆盖猜想的新途径 |
| |
| 引用本文： | 刘彦佩. 通往图的双圈覆盖猜想的新途径[J]. 运筹学学报, 2000, 4(1): 50-54 |
| |
| 作者姓名： | 刘彦佩 |
| |
| 作者单位： | 北方交通大学数学系,北京100044 |
| |
| 基金项目： | Supported by NNSF in China under Grant No. 19831080. |
| |
| 摘 要： | 本文提出了一些新的方法以接近图的用圈二重覆盖边的猜想，通称图的双圈覆盖猜想。因２０余年尚未解决而在图论中著名。从中，也提出了一些新的猜想。并论述了它们之间，以及它们与图的驿圈盖猜想之间的关系。
|
| 关 键 词： | 图 嵌入 二重覆盖 双圈覆盖猜想 |
| 修稿时间： | 1999-11-23 |
New Approaches to the Double Cover Conjecture of Graphs by Circuits |
| |
| YANPEI LIU. New Approaches to the Double Cover Conjecture of Graphs by Circuits[J]. OR Transactions, 2000, 4(1): 50-54 |
| |
| Authors: | YANPEI LIU |
| |
| Affiliation: | YANPEI LIU(Department of Mathematics, Northern Jiaotong University, Beijing 100044, China) |
| |
| Abstract: | This article provides a number of new ways to access the famous conjecture on the double covering of graphs by circuits which is still open for more than 20 years in posing a number of conjectures which look to have more approaches than what has been used for the double cover conjecture by circuits. The relationships among them are established. |
| |
| Keywords: | graph surface embedding circuit double covering. |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
