Acta Mathematica Academiae Scientiarum Hungarica

March 1976, Volume 28, Issue 1–2, pp 77–80 | Cite as

Maximal circuits of graphs. I

• Authors
• Authors and affiliations

• D. R. Woodall

Article

Received: 02 January 1975

• 61 Downloads
• 21 Citations

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

Preview

Unable to display preview. Download preview PDF.

References

1. [1]
   G. A. Dirac, Some theorems on abstract graphs,Proc. London Math. Soc., (3)2 (1952), 69–81.Google Scholar
2. [2]
   P. Erdős andT. Gallai, On maximal paths and circuits of graphsActa Math. Acad. Sci. Hungar.,10 (1959), 337–356.Google Scholar
3. [3]
   R. J. Faudree andR. H. Schelp, Path Ramsey numbers in multicolorings,J. Combinatorial Theory Ser. B. 19 (1975), 150–160.Google Scholar
4. [4]
   D. R. Woodall, Sufficient conditions for circuits in graphs,Proc. London Math. Soc., (3)24 (1972), 739–755.Google Scholar
5. [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

Copyright information

© Akadémiai Kiadó 1976

Authors and Affiliations

• D. R. Woodall
  • 1

1. 1.Department of MathematicsUniversity of NottinghamNottinghamEngland