The domatic number problem on some perfect graph families

Haim Kaplan; Ron Shamir

doi:10.1016/0020-0190(94)90054-X

The domatic number problem on some perfect graph families

Haim Kaplan, Ron Shamir^*

^*Corresponding author for this work

School of Computer Science

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

29 Scopus citations

Abstract

An extremely simple, linear time algorithm is given for constructing a domatic partition in totally balanced hypergraphs. This simplifies and generalizes previous algorithms for interval and strongly chordal graphs. On the other hand, the domatic number problem is shown to be NP-complete for several families of perfect graphs, including chordal and bipartite graphs.

Original language	English
Pages (from-to)	51-56
Number of pages	6
Journal	Information Processing Letters
Volume	49
Issue number	1
DOIs	https://doi.org/10.1016/0020-0190(94)90054-X
State	Published - 14 Jan 1994

Keywords

Algorithm
Bipartite graphs
Chordal graphs
Classes of perfect graphs
Computational complexity
Domatic number
Domatic partition
Strongly chordal graphs
Totally balanced hypergraphs

Access to Document

10.1016/0020-0190(94)90054-X

Cite this

@article{f38d270a3b474a289a4936589fa1c8e9,

title = "The domatic number problem on some perfect graph families",

abstract = "An extremely simple, linear time algorithm is given for constructing a domatic partition in totally balanced hypergraphs. This simplifies and generalizes previous algorithms for interval and strongly chordal graphs. On the other hand, the domatic number problem is shown to be NP-complete for several families of perfect graphs, including chordal and bipartite graphs.",

keywords = "Algorithm, Bipartite graphs, Chordal graphs, Classes of perfect graphs, Computational complexity, Domatic number, Domatic partition, Strongly chordal graphs, Totally balanced hypergraphs",

author = "Haim Kaplan and Ron Shamir",

year = "1994",

month = jan,

day = "14",

doi = "10.1016/0020-0190(94)90054-X",

language = "אנגלית",

volume = "49",

pages = "51--56",

journal = "Information Processing Letters",

issn = "0020-0190",

publisher = "Elsevier B.V.",

number = "1",

}

TY - JOUR

T1 - The domatic number problem on some perfect graph families

AU - Kaplan, Haim

AU - Shamir, Ron

PY - 1994/1/14

Y1 - 1994/1/14

N2 - An extremely simple, linear time algorithm is given for constructing a domatic partition in totally balanced hypergraphs. This simplifies and generalizes previous algorithms for interval and strongly chordal graphs. On the other hand, the domatic number problem is shown to be NP-complete for several families of perfect graphs, including chordal and bipartite graphs.

AB - An extremely simple, linear time algorithm is given for constructing a domatic partition in totally balanced hypergraphs. This simplifies and generalizes previous algorithms for interval and strongly chordal graphs. On the other hand, the domatic number problem is shown to be NP-complete for several families of perfect graphs, including chordal and bipartite graphs.

KW - Algorithm

KW - Bipartite graphs

KW - Chordal graphs

KW - Classes of perfect graphs

KW - Computational complexity

KW - Domatic number

KW - Domatic partition

KW - Strongly chordal graphs

KW - Totally balanced hypergraphs

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

U2 - 10.1016/0020-0190(94)90054-X

DO - 10.1016/0020-0190(94)90054-X

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:0028312685

SN - 0020-0190

VL - 49

SP - 51

EP - 56

JO - Information Processing Letters

JF - Information Processing Letters

IS - 1

ER -

The domatic number problem on some perfect graph families

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this