Skip to main content
SpringerLink
Log in

Cycles in Circuit Graphs of Matroids

  • Published:
Graphs and Combinatorics Aims and scope Submit manuscript

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 is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  • Alspach, B., Liu, G.: Paths and cycles in matroid base graphs, Graphs Comb. 5, 207–211 (1989)

    Google Scholar 

  • Bondy, J.A., Murty, U.S.R.: Graph Theory With Applications, American Elsevier, New York, 1976

  • Bondy, J.A., Ingleton, A.W.: Pancyclic graphs II, J. Comb. Theory B 20, 41–46 (1976)

    Google Scholar 

  • Broersma, H.J., Li, X.: The connectivity of the basis graph of a branching greedoid, J. Graph Theory 16, 233–237 (1992)

    Google Scholar 

  • Harary, F., Plantholt, M.J.: Classification of interpolation theorems for spanning trees and other families of spanning subgraphs, J. Graph Theory 13(6), 703–712 (1989)

    Google Scholar 

  • Holzman, C.A., Harary, F.: On the tree graph of a matroid, Adv. Math. 22, 187–193 (1972)

    Google Scholar 

  • Li, L., Liu, G.: The connectivities of the adjacency leaf exchange forest graphs, J. Shandong University 39(6), 49–51 (2004)

    Google Scholar 

  • Li, L., Bian, Q., Liu, G.: The base incidence graph of a matroid, J. Shandong University 40(2), 24–40 (2005)

    Google Scholar 

  • Liu, G.: A lower bound on connectivities of matroid base graphs, Discr. Math. 64, 55–66 (1988)

    Google Scholar 

  • Liu, G.: The proof of a conjecture on matroid basis graphs, Sci. China 6(A), 593–599 (1990)

    Google Scholar 

  • Liu, G., Zhang, L.: Forest graphs of graphs, Chinese J. Eng. Math. 22(6), 1100–1104 (2005)

    Google Scholar 

  • Maurer, S.B.: Matroid basis graphs I, J. Comb. Theory B 14, 216–240 (1973)

    Google Scholar 

  • Maurer, S.B.: Matroid basis graphs II, J. Comb. Theory B 15, 121–145 (1973)

    Google Scholar 

  • Murty, U.S.R.: On the number of bases of matroid, In: Proc. Second Louisiana Conference on Combinatorics, pp. 387–410 (1971)

  • Murty, U.S.R.: Extremal critically connected matroids, Discr. Math. 8, 49–58 (1974)

    Google Scholar 

  • Oxley, J.G.: Matroid Theory, Oxford University Press, New York, 1992

Download references

Author information

Authors and Affiliations

  1. School of Mathematics and System Sciences, Shandong University, Jinan, 250100, P. R. China

    Ping Li

  2. School of Mathematics and System Sciences, Shandong University, Jinan, 250100, P. R. China

    Guizhen Liu

Authors
  1. Ping Li
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Guizhen Liu
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Guizhen Liu.

Additional information

This work is supported by the National Natural Science Foundation(60673047) and the Doctoral Program Foundation of Education Ministry (20040422004) of China.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Li, P., Liu, G. Cycles in Circuit Graphs of Matroids. Graphs and Combinatorics 23, 425–431 (2007). https://doi.org/10.1007/s00373-007-0739-7

Download citation

  • Received:

  • Accepted:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00373-007-0739-7

Keywords

Search

Navigation