Contents

Ars Combinatoria

  • Research article

The \(E_2\)-Hamiltonian Property of Circuit Graphs of Matroids

Hao Fan 1, Guizhen Liu2
1State Grid Energy Research Institute, China.
2School of Mathematics, Shandong Univer- sity, Jinan, Shandong, P, R. China. 250100
  • Published: 31/01/2014

Abstract

Let \(G\) be the circuit graph of any connected matroid. It is proved that the circuit graph of a connected matroid with at least three circuits is \(E_2\)-Hamiltonian.

Information
Guidelines
CP Initiatives
Follow CP
Facebook X-twitter Linkedin

1970-2025 CP (Manitoba, Canada) unless otherwise stated.

Citation
Hao Fan , Guizhen Liu. The \(E_2\)-Hamiltonian Property of Circuit Graphs of Matroids[J], Ars Combinatoria, Volume 113. 299-305. .