On the number of cycles possible in digraphs with large girth

DOI10.1016/0166-218X(85)90044-7zbMath0565.05049OpenAlexW2016416768MaRDI QIDQ1058526

Eric W. Allender

Publication date: 1985

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0166-218x(85)90044-7

zbMATH Keywords

directed graphsno short cycles

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Paths and cycles (05C38) Directed graphs (digraphs), tournaments (05C20)

Related Items (5)

On digraphs with no two disjoint directed cycles ⋮ Computer observations of cycles in cubic graphs ⋮ Automaticity. II: Descriptional complexity in the unary case ⋮ On the shortest path problem with negative cost cycles ⋮ The 2-linkage problem for acyclic digraphs

Cites Work

• Unnamed Item

This page was built for publication: On the number of cycles possible in digraphs with large girth