| HAJóS' CONJECTURE AND CONNECTIVITY OF EULERIAN GRAPHS |
| |
| 作者姓名： | XU Baogang |
| |
| 作者单位： | School of Mathematics and Computer Science，Nanjing Normal University，Nanjing 210097，China |
| |
| 基金项目： | This research is partially supported by the National Postdoctoral Fund of China and Natural Science Foundation of China(No. 10001035)，This work was finished while the author was working for Academy of Mathematics and Systems Science, Chinese of Academy |
| |
| 摘 要： | 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 sufficient to prove this new conjecture for 3-connected graphs. Furthermore, a special 3-cut is considered also.
|
HAJOS' CONJECTURE AND CONNECTIVITY OF EULERIAN GRAPHS |
| |
| XU Baogang.HAJOS'''' CONJECTURE AND CONNECTIVITY OF EULERIAN GRAPHS[J].Journal of Systems Science and Complexity,2002(3). |
| |
| Authors: | XU Baogang |
| |
| Abstract: | 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 sufficient to prove this new conjecture for 3-connected graphs. Furthermore, a special 3-cut is considered also. |
| |
| Keywords: | Circuit decomposition connectivity eulerian graph |
| 本文献已被 CNKI 等数据库收录！ |
