| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 471224 | Computers & Mathematics with Applications | 2008 | 6 Pages |
Abstract
In the circuit graph of a matroid the vertices are the circuits and the edges are the pairs CC′CC′ such that CC and C′C′ have nonempty intersection. It is proved that the circuit graph of a connected matroid with at least four circuits is uniformly Hamilton.
Keywords
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science (General)
Authors
Ping Li, Guizhen Liu,