A sufficient condition for the existence of an anti-directed 2-factor in a directed graph

Details A sufficient condition for the existence of an anti-directed 2-factor in a directed graph A sufficient condition for the existence of an anti-directed 2-factor in a directed graph

2010-12-06

arxiv.org/abs/1012.1231v2

Mathematics

Combinatorics

Scientific paper

Let D be a directed graph with vertex set V and order n. An anti-directed hamiltonian cycle H in D is a hamiltonian cycle in the graph underlying D such that no pair of consecutive arcs in H form a directed path in D. An anti-directed 2-factor in D is a vertex-disjoint collection of anti-directed cycles in D that span V. It was proved in [3] that if the indegree and the outdegree of each vertex of D is greater than (9/16)n then D contains an anti-directed hamilton cycle. In this paper we prove that given a directed graph D, the problem of determining whether D has an anti-directed 2-factor is NP-complete, and we use a proof technique similar to the one used in [3] to prove that if the indegree and the outdegree of each vertex of D is greater than (24/46)n then D contains an anti-directed 2-factor.

Affiliated with

Also associated with

No associations

Rating

A sufficient condition for the existence of an anti-directed 2-factor in a directed graph 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 existence of an anti-directed 2-factor in a directed graph, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A sufficient condition for the existence of an anti-directed 2-factor in a directed graph will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-168228