Covering the edges of digraphs in $\mathscr{D}(3,3)$ and $\mathscr{D}(4,4)$ with directed cuts

Details Covering the edges of digraphs in $\mathscr{D}(3,3)$ and $\mathscr{D}(4,4)$ with directed cuts Covering the edges of digraphs in $\mathscr{D}(3,3)$ and $\mathscr{D}(4,4)$ with directed cuts

2011-09-21

arxiv.org/abs/1109.4671v2

Mathematics

Combinatorics

Scientific paper

For nonnegative integers $k$ and $l$, let $\mathscr{D}(k,l)$ denote the family of digraphs in which every vertex has either indegree at most $k$ or outdegree at most $l$. In this paper we prove that the edges of every digraph in $\mathscr{D}(3,3)$ and $\mathscr{D}(4,4)$ can be covered by at most five directed cuts and present an example in $\mathscr{D}(3,3)$ showing that this result is best possible.

Affiliated with

Also associated with

No associations

Rating

Covering the edges of digraphs in $\mathscr{D}(3,3)$ and $\mathscr{D}(4,4)$ with directed cuts 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 Covering the edges of digraphs in $\mathscr{D}(3,3)$ and $\mathscr{D}(4,4)$ with directed cuts, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Covering the edges of digraphs in $\mathscr{D}(3,3)$ and $\mathscr{D}(4,4)$ with directed cuts will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-261783