Some approaches to a conjecture on short cycles in digraphs

DOI10.1016/S0166-218X(01)00279-7zbMath1002.05030OpenAlexW1964810349WikidataQ122931465 ScholiaQ122931465MaRDI QIDQ1613363

Hajo J. Broersma, Xue Liang Li

Publication date: 29 August 2002

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

Full work available at URL: https://doi.org/10.1016/s0166-218x(01)00279-7

zbMATH Keywords

vertex degree

Mathematics Subject Classification ID

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

Related Items (2)

Maximum size of digraphs with some parameters ⋮ A new lower bound on the strong connectivity of an oriented graph. Application to diameters with a particular case related to Caccetta Häggkvist conjecture

Cites Work

• Unnamed Item
• A note on short cycles in digraphs
• Short cycles in directed graphs
• A note on minimal directed graphs with given girth
• Short cycles in digraphs
• Directed triangles in digraphs
• Counting subgraphs: A new approach to the Caccetta-Häggkvist conjecture
• On minimal regular digraphs with given girth
• Directed triangles in directed graphs

This page was built for publication: Some approaches to a conjecture on short cycles in digraphs