We show that for each k greater than or equal to 4 there exists a conn
ected k-domination critical graph with independent domination number e
xceeding k, thus disproving a conjecture of Sumner and Blitch (J. Comb
inatorial Theory B 34 (1983), 65-76) in all cases except k = 3. (C) 19
96 John Wiley & Sons, Inc.