Maximal circuits of graphs. I

D. R. Woodall

doi:10.1007/bf01902497

journal article Mar 01, 1976

Maximal circuits of graphs. I

D. R. Woodall

Acta Mathematica Academiae Scientiarum Hungaricae Vol. 28 No. 1-2 pp. 77-80 · Springer Science and Business Media LLC

View at Publisher Save 10.1007/bf01902497

Topics

No keywords indexed for this article. Browse by subject →

References

5

[1]

G. A. Dirac, Some theorems on abstract graphs,Proc. London Math. Soc., (3)2 (1952), 69–81. 10.1112/plms/s3-2.1.69

[2]

On maximal paths and circuits of graphs

P. Erdős, T. Gallai

Acta Mathematica Academiae Scientiarum Hungaricae 1959 10.1007/bf02024498

[3]

R. J. Faudree andR. H. Schelp, Path Ramsey numbers in multicolorings,J. Combinatorial Theory Ser. B. 19 (1975), 150–160. 10.1016/0095-8956(75)90080-5

[4]

D. R. Woodall, Sufficient conditions for circuits in graphs,Proc. London Math. Soc., (3)24 (1972), 739–755. 10.1112/plms/s3-24.4.739

[5]

D. R. Woodall, The binding number of a graph and its Anderson number,J. Combinatorial Theory Ser. B. 15 (1973), 225–255. 10.1016/0095-8956(73)90038-5

Cited By

51

The maximum number of cliques in graphs with prescribed order, circumference and minimum degree

Leilei Zhang · 2023

European Journal of Combinatorics

Metrics

51

Citations

5

References

Details

Published: Mar 01, 1976
Vol/Issue: 28(1-2)
Pages: 77-80
License: View

Authors

D

D. R. Woodall

Cite This Article

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

Maximal circuits of graphs. I

You May Also Like