Highly Influenced

# The Domatic Number Problem on Some Perfect Graph Families

@article{Kaplan1994TheDN, title={The Domatic Number Problem on Some Perfect Graph Families}, author={Haim Kaplan and Ron Shamir}, journal={Inf. Process. Lett.}, year={1994}, volume={49}, pages={51-56} }

- Published 1994 in Inf. Process. Lett.
DOI:10.1016/0020-0190(94)90054-X

An extremely simple, linear time algorithm is given for constructing a domatic partition in totally balanced hypergraphs. This simpli es 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.Â

Highly Cited

This paper has 30 citations. REVIEW CITATIONS

#### From This Paper

##### Figures, tables, and topics from this paper.

19 Citations

15 References

Similar Papers