(1) School of Mathematics and System Sciences, Shandong University, Jinan, 250100, P. R. China;(2) School of Mathematics and System Sciences, Shandong University, Jinan, 250100, P. R. China
Abstract:
Let G be the circuit graph of any connected matroid. We prove that G is edge-pancyclic if it has at least three vertices.
This work is supported by the National Natural Science Foundation(60673047) and the Doctoral Program Foundation of Education
Ministry (20040422004) of China.