Covering the edges of digraphs in D (3, 3) and D (4, 4) with directed cuts

Yandong Bai; Binlong Li; Shenggui Zhang

doi:10.1016/j.disc.2012.02.001

Covering the edges of digraphs in D (3, 3) and D (4, 4) with directed cuts

Yandong Bai, Binlong Li, Shenggui Zhang

School of Mathematics and Statistics

Northwestern Polytechnical University Xian

Research output: Contribution to journal › Article › peer-review

3 Scopus citations

Abstract

For nonnegative integers k and l, let 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 D(3,3) and D(4,4) can be covered by at most five directed cuts and present an example in D(3,3) showing that this result is best possible.

Original language	English
Pages (from-to)	1596-1601
Number of pages	6
Journal	Discrete Mathematics
Volume	312
Issue number	10
DOIs	https://doi.org/10.1016/j.disc.2012.02.001
State	Published - 28 May 2012

Keywords

Covering
Digraphs
Directed cuts
Indegree
Outdegree

Access to Document

10.1016/j.disc.2012.02.001

Cite this

@article{849c8ccb2a3e42f4a2abf14971a82446,

title = "Covering the edges of digraphs in D (3, 3) and D (4, 4) with directed cuts",

abstract = "For nonnegative integers k and l, let 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 D(3,3) and D(4,4) can be covered by at most five directed cuts and present an example in D(3,3) showing that this result is best possible.",

keywords = "Covering, Digraphs, Directed cuts, Indegree, Outdegree",

author = "Yandong Bai and Binlong Li and Shenggui Zhang",

year = "2012",

month = may,

day = "28",

doi = "10.1016/j.disc.2012.02.001",

language = "英语",

volume = "312",

pages = "1596--1601",

journal = "Discrete Mathematics",

issn = "0012-365X",

publisher = "Elsevier B.V.",

number = "10",

}

TY - JOUR

T1 - Covering the edges of digraphs in D (3, 3) and D (4, 4) with directed cuts

AU - Bai, Yandong

AU - Li, Binlong

AU - Zhang, Shenggui

PY - 2012/5/28

Y1 - 2012/5/28

N2 - For nonnegative integers k and l, let 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 D(3,3) and D(4,4) can be covered by at most five directed cuts and present an example in D(3,3) showing that this result is best possible.

AB - For nonnegative integers k and l, let 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 D(3,3) and D(4,4) can be covered by at most five directed cuts and present an example in D(3,3) showing that this result is best possible.

KW - Covering

KW - Digraphs

KW - Directed cuts

KW - Indegree

KW - Outdegree

UR - http://www.scopus.com/inward/record.url?scp=84862811891&partnerID=8YFLogxK

U2 - 10.1016/j.disc.2012.02.001

DO - 10.1016/j.disc.2012.02.001

M3 - 文章

AN - SCOPUS:84862811891

SN - 0012-365X

VL - 312

SP - 1596

EP - 1601

JO - Discrete Mathematics

JF - Discrete Mathematics

IS - 10

ER -

Covering the edges of digraphs in D (3, 3) and D (4, 4) with directed cuts

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this