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

DOI10.1016/j.disc.2007.09.025zbMath1189.05069OpenAlexW2063138682WikidataQ122971067 ScholiaQ122971067MaRDI QIDQ2519841

Nicolas Lichiardopol

Publication date: 27 January 2009

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

Full work available at URL: https://doi.org/10.1016/j.disc.2007.09.025

zbMATH Keywords

diameteroriented graphtournamentminimum out-degreeminimum in-degreevertex strong connectivity

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Directed graphs (digraphs), tournaments (05C20) Connectivity (05C40)

Cites Work

• Hamiltonian-connected tournaments
• Some approaches to a conjecture on short cycles in digraphs
• Unnamed Item
• Unnamed Item

This page was built for publication: 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