matroid;
circuit graph of matroid;
Hamilton cycled;
uniformly Hamilton;
critical matroid;
D O I:
10.1016/j.camwa.2007.04.039
中图分类号:
O29 [应用数学];
学科分类号:
070104 ;
摘要:
In the circuit graph of a matroid the vertices are the circuits and the edges are the pairs CC' such that C and C' have nonempty intersection. It is proved that the circuit graph of a connected matroid with at least four circuits is uniformly Hamilton. (c) 2007 Elsevier Ltd. All rights reserved.