Hamilton cycles in circuit graphs of matroids

被引：6
作者：
Li, Ping [1 ]
Liu, Guizhen [1 ]
机构：
[1] Shandong Univ, Sch Math & Syst Sci, Jinan 250100, Peoples R China
来源：
COMPUTERS & MATHEMATICS WITH APPLICATIONS | 2008年 / 55卷 / 04期
基金：
中国国家自然科学基金;
关键词：
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.
引用
收藏
页码：654 / 659
页数：6
相关论文
共 15 条
12