On the pancyclicity of digraphs with large semi-degrees

Details On the pancyclicity of digraphs with large semi-degrees On the pancyclicity of digraphs with large semi-degrees

2011-11-08

arxiv.org/abs/1111.1841v1

Mathematics

Combinatorics

32 pages

Scientific paper

Let $D$ be an directed graph on $p\geq 10$ vertices with minimum degree at
least $p-1$ and minimum semi-degree at least $ p/2 -1$. We present a detailed
proof of the following result [13]: The digraph $D$ is pancyclic, unless some
extremal cases (which are characterized).

Affiliated with

Also associated with

No associations

Rating

On the pancyclicity 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 On the pancyclicity of digraphs with large semi-degrees, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On the pancyclicity of digraphs with large semi-degrees will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-53323