Bounds of the longest directed cycle length for minimal strong digraphs

DOI10.1016/0012-365X(88)90037-4zbMATH Open0651.05045OpenAlexW2010123480MaRDI QIDQ1106239FDOQ1106239

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

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

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)

Cites Work

• On Orientations, Connectivity and Odd-Vertex-Pairings in Finite Graphs
• Title not available (Why is that?)
• Diconnected Orientations and a Conjecture of Las Vergnas
• Cycles in digraphs– a survey
• On basis diagraphs
• Long Cycles in Digraphs
• Chemins Et Circuits Dans Les Graphes Orientes

Cited In (3)

• Title not available (Why is that?)
• 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)