Bounds of the longest directed cycle length for minimal strong digraphs

DOI10.1016/0012-365X(88)90037-4MaRDI QIDQ1106239zbMATH OpenOpenAlexFDO

Authors Zhibo Chen, Fuji 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

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

Recommendations

• Structure of cycles in minimal strong digraphs
• Publication:3487413
• Minimal strong connected digraphs
• scientific article; zbMATH DE number 4027500
• On strong digraphs with a unique minimally strong subdigraph

Cites work

• scientific article; zbMATH DE number 3522018 (Why is no real title available?)
• Chemins Et Circuits Dans Les Graphes Orientes
• Cycles in digraphs– a survey
• Diconnected Orientations and a Conjecture of Las Vergnas
• Long Cycles in Digraphs
• On Orientations, Connectivity and Odd-Vertex-Pairings in Finite Graphs
• On basis diagraphs

Cited in

(3)

• scientific article; zbMATH DE number 4158648 (Why is no real title available?)
• Structure of cycles in minimal strong digraphs
• Minimal strong connected digraphs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1106239)