Girth in digraphs

DOI10.1002/JGT.3190040311MaRDI QIDQ4200243zbMATH OpenOpenAlexFDO

Authors Jean-Claude Bermond, Marie-Claude Heydemann, D. Sotteau, Anne Germa

Publication date 1980

Published in Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL https://hal.inria.fr/hal-02333830/file/40-BGHS80-girth.pdf

zbMATH Keywords

digraphscyclesgirth

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Paths and cycles (05C38)

Cited in

(7)

• 3-free strong digraphs with the maximum size
• Parameterized algorithms for feedback set problems and their duals in tournaments
• Turán number of 3-free strong digraphs with out-degree restriction
• 4-Free Strong Digraphs with the Maximum Size
• Restricted arc-connectivity of Harary digraphs
• Turán problems for \(k\)-geodetic digraphs
• Cycles in strong oriented graphs

This page was built for publication: Girth in digraphs

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