Bounds of the longest directed cycle length for minimal strong digraphs

DOI10.1016/0012-365X(88)90037-4zbMath0651.05045OpenAlexW2010123480MaRDI QIDQ1106239

Zhibo Chen, Fu Ji Zhang

Publication date: 1988

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

Full work available at URL: https://doi.org/10.1016/0012-365x(88)90037-4

zbMATH Keywords

cyclomatic numberminimal strong digraphslongest directed cyclebounds on cycle lengthsreducible chain

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Paths and cycles (05C38) Directed graphs (digraphs), tournaments (05C20)

Related Items (1)

Structure of cycles in minimal strong digraphs

Cites Work

• Unnamed Item
• On Orientations, Connectivity and Odd-Vertex-Pairings in Finite Graphs
• Chemins Et Circuits Dans Les Graphes Orientes
• Long Cycles in Digraphs
• Cycles in digraphs– a survey
• Diconnected Orientations and a Conjecture of Las Vergnas
• On basis diagraphs

This page was built for publication: Bounds of the longest directed cycle length for minimal strong digraphs