Skip to main content
SpringerLink
Log in

Maximal circuits of graphs. I

  • Published:
Acta Mathematica Academiae Scientiarum Hungarica Aims and scope Submit manuscript

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

References

  1. G. A. Dirac, Some theorems on abstract graphs,Proc. London Math. Soc., (3)2 (1952), 69–81.

    Google Scholar 

  2. P. Erdős andT. Gallai, On maximal paths and circuits of graphsActa Math. Acad. Sci. Hungar.,10 (1959), 337–356.

    Google Scholar 

  3. R. J. Faudree andR. H. Schelp, Path Ramsey numbers in multicolorings,J. Combinatorial Theory Ser. B. 19 (1975), 150–160.

    Google Scholar 

  4. D. R. Woodall, Sufficient conditions for circuits in graphs,Proc. London Math. Soc., (3)24 (1972), 739–755.

    Google Scholar 

  5. D. R. Woodall, The binding number of a graph and its Anderson number,J. Combinatorial Theory Ser. B. 15 (1973), 225–255.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, University of Nottingham, NG7 2RD, Nottingham, England

    D. R. Woodall

Authors
  1. D. R. Woodall
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Woodall, D.R. Maximal circuits of graphs. I. Acta Mathematica Academiae Scientiarum Hungaricae 28, 77–80 (1976). https://doi.org/10.1007/BF01902497

Download citation

  • Received:

  • Issue Date:

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

Search

Navigation