On maximal circuits in directed graphs

@inproceedings{Lewin1975OnMC,
  title={On maximal circuits in directed graphs},
  author={Mordechai Lewin},
  year={1975}
}
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 Erdos and Gallai for undirected graphs is supplied in the Appendix. 

Similar Papers

Citations

Publications citing this paper.
SHOWING 1-10 OF 16 CITATIONS