Article PDF
Avoid common mistakes on your manuscript.
References
G. A. Dirac, Some theorems on abstract graphs,Proc. London Math. Soc., (3)2 (1952), 69–81.
P. Erdős andT. Gallai, On maximal paths and circuits of graphsActa Math. Acad. Sci. Hungar.,10 (1959), 337–356.
R. J. Faudree andR. H. Schelp, Path Ramsey numbers in multicolorings,J. Combinatorial Theory Ser. B. 19 (1975), 150–160.
D. R. Woodall, Sufficient conditions for circuits in graphs,Proc. London Math. Soc., (3)24 (1972), 739–755.
D. R. Woodall, The binding number of a graph and its Anderson number,J. Combinatorial Theory Ser. B. 15 (1973), 225–255.
Author information
Authors and Affiliations
Rights 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
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01902497