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 - researchr publication

researchr

You are not signed in
Sign in
Sign up

Nicolas Lichiardopol. 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. Discrete Mathematics, 308(22):5274-5279, 2008. [doi]

Abstract is missing.

runs on WebDSL