HAJOS' CONJECTURE AND CONNECTIVITY OF EULERIAN GRAPHS  

HAJóS' CONJECTURE AND CONNECTIVITY OF EULERIAN GRAPHS

作　　者：XU Baogang (School of Mathematics and Computer Science, Nanjing Normal University, Nanjing 210097, China) 

出　　处：《Journal of Systems Science & Complexity》2002年第3期295-298,共4页系统科学与复杂性学报（英文版）

基　　金：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.

关 键 词：Circuit decomposition CONNECTIVITY eulerian graph. 

分 类 号：O157.5[理学—数学]