Skip to main content
Log in

Abstract

A graphG withn vertices has propertyp(r, s) ifG contains a path of lengthr and if every such path is contained in a circuit of lengths. G. A. Dirac and C. Thomassen [Math. Ann.203 (1973), 65–75] determined graphs with propertyp(r,r+1). We determine the least number of edges in a graphG in order to insure thatG has propertyp(r,s), we determine the least number of edges possible in a connected graph with propertyp(r,s) forr=1 and alls, forr=k ands=k+2 whenk=2, 3, 4, and we give bounds in other cases. Some resulting extremal graphs are determined. We also consider a generalization of propertyp(2,s) in which it is required that each pair of edges is contained in a circuit of lengths. Some cases of this last property have been treated previously by U. S. R. Murty [inProof Techniques in Graph Theory, ed. F. Harary, Academic Press, New York, 1969, pp. 111–118].

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

References

  1. B. Alspach,Cycles of each length in regular tournaments, Canad. Math. Bull.10 (1967), 283–286.

    MATH  MathSciNet  Google Scholar 

  2. B. Alspach and T. Brown, private communication (1974).

  3. B. Alspach, K. B. Reid and D. P. Roselle,Bypasses in asymmetric graphs, J. Combinatorial Theory Ser. B17 (1974), 11–18.

    Article  MATH  MathSciNet  Google Scholar 

  4. G. Chartrand and H. V. Kronk,Randomly traceable graphs, SIAM J. Appl. Math.16 (1968), 696–700.

    Article  MATH  MathSciNet  Google Scholar 

  5. G. A. Dirac and C. Thomassen,Graphs in which every finite path is contained in a circuit, Math. Ann.203 (1973), 65–75.

    Article  MATH  MathSciNet  Google Scholar 

  6. F. Harary,Graph Theory, Addison-Wesley, Reading, Mass., 1969.

    Google Scholar 

  7. H. V. Kronk,A note on k-path Hamiltonian graphs, J. Combinatorial Theory7 (1969), 104–106.

    Article  MATH  MathSciNet  Google Scholar 

  8. J. W. Moon,Topics on Tournaments, Holt, Rinehart and Winston, New York, 1968, pp. 6–7.

    MATH  Google Scholar 

  9. U. S. R. Murty,Extremal nonseparable graphs of diameter 2, inProof Techniques in Graph Theory, ed. F. Harary, Academic Press, New York, 1969, pp. 111–118.

    Google Scholar 

  10. O. Ore,Arc coverings of graphs, Ann. Mat. Pura Appl.55 (1961), 315–322.

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Reid, K.B., Thomassen, C. Edge sets contained in circuits. Israel J. Math. 24, 305–319 (1976). https://doi.org/10.1007/BF02834761

Download citation

  • Received:

  • Issue Date:

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

Keywords

Navigation