Properties of Hamilton cycles of circuit graphs of matroids
Hao Fan , Guizhen Liu
Front. Math. China ›› 2013, Vol. 8 ›› Issue (4) : 801 -809.
Properties of Hamilton cycles of circuit graphs of matroids
Let G be a circuit graph of a connected matroid. P. Li and G. Liu [Comput. Math. Appl., 2008, 55: 654–659] proved that G has a Hamilton cycle including e and another Hamilton cycle excluding e for any edge e of G if G has at least four vertices. This paper proves that G has a Hamilton cycle including e and excluding e′ for any two edges e and e′ of G if G has at least five vertices. This result is best possible in some sense. An open problem is proposed in the end of this paper.
Matroid / circuit graph of matroid / Hamilton cycle
| [1] |
|
| [2] |
|
| [3] |
|
| [4] |
|
| [5] |
|
| [6] |
|
| [7] |
|
| [8] |
|
| [9] |
|
| [10] |
|
| [11] |
|
| [12] |
|
| [13] |
|
| [14] |
|
| [15] |
|
| [16] |
|
| [17] |
|
| [18] |
|
| [19] |
|
/
| 〈 |
|
〉 |