A degree condition for cycles of maximum length in bipartite digraphs

Details A degree condition for cycles of maximum length in bipartite digraphs A degree condition for cycles of maximum length in bipartite digraphs

2011-01-25

arxiv.org/abs/1101.4973v2

Discrete Math. 312 (2012), 1117--1122

Mathematics

Combinatorics

8 pages, minor exposition changes

Scientific paper

10.1016/j.disc.2011.11.032

We prove a sharp Ore-type criterion for hamiltonicity of balanced bipartite
digraphs: A bipartite digraph D, with colour classes of cardinality N, is
hamiltonian if, for every pair of vertices u and v from opposite colour classes
of D such that the arc uv is not in D, the sum of the outdegree of u and the
indegree of v is greater than or equal to N+2.

Affiliated with

Also associated with

No associations

Rating

A degree condition for cycles of maximum length in bipartite digraphs 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 degree condition for cycles of maximum length in bipartite digraphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A degree condition for cycles of maximum length in bipartite digraphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-418432