Skip to main content
Log in

Bounding the number of circuits of a graph

  • Published:
Combinatorica Aims and scope Submit manuscript

Abstract

Letc(G) denote the number of circuits of a graphG. In this paper, we characterize those minor-closed classesG of graphs for which there is a polynomial functionp(.) such thatc(G)p(|E(G)|) for all graphsG inG.

This is a preview of subscription content, log in via an institution to check access.

Access this article

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

  1. E. Balas, andC.S. Yu: On graphs with polynomially solvable maximum-weight clique problem,Networks,19 (1989), 247–253.

    Google Scholar 

  2. R. P. Dilworth: A decomposition theorem for partially ordered sets,Ann. Math. 51 (1950), 161–166.

    Google Scholar 

  3. G. Ding: Graphs with not too many spanning trees,Networks,25 (1995), 193–197.

    Google Scholar 

  4. G. Ding Bounding the number of bases of a matroid,Combinatorica,15 (2) (1995), 159–165.

    Google Scholar 

  5. G. Ding: Excluding a long double path minor,J. Combinatorial Theory (B),66, (1) (1996), 11–23.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Ding, G. Bounding the number of circuits of a graph. Combinatorica 16, 331–341 (1996). https://doi.org/10.1007/BF01261319

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01261319

Mathematics Subject Classification (1991)

Navigation