|
|||||
|
|
Upon the removal of the edges of a 1-factor from an even circuit in a 2-connected graph |
|
| Authors: | Philip Sinclair |
| Institution: | Department of Mathematics, College of Natural Sciences, Ulsan University, P.O. Box 18, Ulsan 680 749, Republic of Korea |
| Abstract: | Let G be a 2-connected graph with minimum degree at least 3. We prove that there exists an even circuit C in G with factorization F={F1,F2} such that G−E(F1) is 2-connected. |
| Keywords: | Removable even circuits 1-factors |
| 本文献已被 ScienceDirect 等数据库收录！ | |