Journal ArticleOPEN ACCESS

On maximal circuits in directed graphs

Journal of Combinatorial Theory, Series B (1975) 18(2) 175-179
DOI: 10.1016/0095-8956(75)90045-3
28Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

An exact bound is obtained for the number of edges in a directed graph which ensures the existence of a circuit exceeding a prescribed length. Another proof of an analogous result of Erdös and Gallai for undirected graphs is supplied in the Appendix. © 1975.

Cite

CITATION STYLE

APA

Lewin, M. (1975). On maximal circuits in directed graphs. Journal of Combinatorial Theory, Series B, 18(2), 175–179. https://doi.org/10.1016/0095-8956(75)90045-3

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free