| HAJOS‘ CONJECTURE AND CONNECTIVITY OF EULERIAN GRAPHS |
| |
| 作者姓名： | XUBaogang |
| |
| 作者单位： | SchoolofMathematicsandComputerScience,NanjingNormalUnivesity,Nanjing210097,China |
| |
| 摘 要： | Hajos‘ conjecture asserts that a simple eulerian graph on n vertices can be decomposed into at most n-1/2 circuits,In this paper,we propose a new conjecture which is equivalent to Hajos‘ conjecture.and show that to prove Hajos‘ conjecture,it is sufficent to prove this new conjecture for 3-connected graphs.Furthermore,a special 3-cut is considered also.
|
| 关 键 词： | 计算机图形 HAJOS共轭 连通性 图形 |
| 本文献已被 维普 等数据库收录！ |
|
