A sufficient condition for the hamiltonian property of digraphs with large semi-degrees

Details A sufficient condition for the hamiltonian property of digraphs with large semi-degrees A sufficient condition for the hamiltonian property of digraphs with large semi-degrees

2011-11-08

arxiv.org/abs/1111.1843v1

Mathematics

Combinatorics

18 pages

Scientific paper

Let $D$ be a digraph on $p\geq 5$ vertices with minimum degree at least $p-1$
and with minimum semi-degree at least $p/2-1$. For $D$ (unless some extremal
cases) we present a detailed proof of the following results [12]: (i) $D$
contains cycles of length 3, 4 and $p-1$; (ii) if $p=2n$, then $D$ is
hamiltonian.

Affiliated with

Also associated with

No associations

Rating

A sufficient condition for the hamiltonian property of digraphs with large semi-degrees does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A sufficient condition for the hamiltonian property of digraphs with large semi-degrees, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A sufficient condition for the hamiltonian property of digraphs with large semi-degrees will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-53333