Connected domatic number in planar graphs

Czechoslovak Mathematical Journal

Volumn 51, Issue 1, 2001, Pages 173-179

  Hartnell, Bert L ^a   Rall, Douglas F ^b  

^a SAINT MARY S UNIVERSITY   (Canada)

^b FURMAN UNIVERSITY   (United States)

Author keywords

Connected domatic number; Connected dominating set; Planar

Indexed keywords

EID: 27144529580     PISSN: 00114642     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1013770108453     Document Type: Article

References (6)

1. G. Chartrand and L. Lesniak: Graphs and Digraphs. Prindle, Weber & Schmidt, Boston, 1986.
2. S. T. Hedetniemi: personal communication.
3. S. M. Hedetniemi, S. T. Hedetniemi and R. Reynolds: Combinatorial Problems on Chessboards: II, Chapter 6. Domination in Graphs: Advanced Topics. Marcel Dekker, Inc., New York, 1997.
4. S. T. Hedetniemi and R. Laskar: Connected domination in graphs. Graph Theory and Combinatorics. Academic Press, London-New York, 1984, pp. 209-217.
5. E. Sampathkumar and H. B. Walikar: The connected domination number of a graph. J. Math. Phys. Sci. 13 (1979), 607-613.
6. B. Zelinka: Connected domatic number of a graph. Math. Slovaca 36 (1986), 387-392.