|
|||||
|
|
On maximal circuits in directed graphs |
|
| Authors: | Mordechai Lewin |
| Affiliation: | Department of Mathematics, The Technion, Israel Institute of Technology, Haifa Israel |
| 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. |
| Keywords: | |
| 本文献已被 ScienceDirect 等数据库收录！ | |