Girth in digraphs

DOI10.1002/jgt.3190040311zbMath0412.05048OpenAlexW2071075689MaRDI QIDQ4200243

Marie-Claude Heydemann, Jean-Claude Bermond, Dominique 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

cyclesdigraphsgirth

Mathematics Subject Classification ID

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

Related Items (6)

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 ⋮ Turán problems for \(k\)-geodetic digraphs ⋮ Cycles in strong oriented graphs ⋮ 3-free strong digraphs with the maximum size

This page was built for publication: Girth in digraphs