Finding a domatic partition of an interval graph in time O(n)

SIAM Journal on Discrete Mathematics

Volumn 9, Issue 2, 1996, Pages 167-172

  Manacher, Glenn K ^a   Mankus, Terrance A ^a  

^a UNIVERSITY OF ILLINOIS AT CHICAGO   (United States)

Author keywords

Domatic number; Domatic partition; Domination; Interval graph

Indexed keywords

INTERVAL GRAPH; PARTITION;

GRAPH THEORY;

ALGORITHMS;

EID: 0030373894     PISSN: 08954801     EISSN: None     Source Type: Journal    
DOI: 10.1137/0409015     Document Type: Article

References (11)

1. S. R. ARIKATI, private communication, December 1990.
2. A. A. BERTOSSI, On the domatic number of interval graphs, Inform. Process. Lett., 28 (1988), pp. 275-280.
3. M. A. BONUCCELLI, Dominating sets and domatic number of circular arc graphs, Discrete Appl. Math., 12 (1985), pp. 203-213.
4. E. J. COCKAYNE AND S. T. HEDETNIEMI, Toward a theory of domination in graphs, Networks, 7 (1977), pp. 247-261.
5. M. FARBER, Domination, independent domination, and duality in strongly chordal graphs, Discrete Appl. Math., 7 (1984), pp. 115-130.
6. M. R. GAREY AND D. S. JOHNSON, Computers and Intractability, a Guide to the Theory of NP-Completeness, W. H. Freeman, San Francisco, 1979.
7. D. S. JOHNSON, The NP-completeness column: An ongoing guide, J. Algorithms, 6 (1985), pp. 434-451.
8. T.-L. LU, P.-H. HO, AND G. CHANG, The domatic number problem in interval graphs, SIAM J. Discrete Math., 3 (1990), pp. 531-536.
9. S. L. PENG AND M. S. CHANG, A new approach for domatic number problem on interval graphs, in Proceedings of the National Computer Symposium, 1991, R.O.C., pp. 236-241.
10. A simple linear time algorithm for the domatic partition problem on strongly chordal graphs, Inform. Process. Lett., 43 (1992), pp. 297-300.
11. S. R. ARIKATI AND C. PANDU RANGAN, Linear algorithms for domatic number problems on interval graphs, Inform. Process. Lett., 33 (1989/90), pp. 29-33.