Coauthor Index - Ask others: ACM DL/Guide - CiteSeer - CSB - Google - MSN - Yahoo

2004 | ||
---|---|---|

6 | EE | William D. Weakley: Erratum to "Upper bounds for domination numbers of the queen's graph": [Discrete Mathematics 242 (2002) 229-243]. Discrete Mathematics 277(1-3): 321- (2004) |

2002 | ||

5 | EE | William D. Weakley: Upper bounds for domination numbers of the queen's graph. Discrete Mathematics 242(1-3): 229-243 (2002) |

2001 | ||

4 | EE | Patric R. J. Östergård, William D. Weakley: Values of Domination Numbers of the Queen's Graph. Electr. J. Comb. 8(1): (2001) |

1999 | ||

3 | Patric R. J. Östergård, William D. Weakley: Constructing Covering Codes with Given Automorphisms. Des. Codes Cryptography 16(1): 65-73 (1999) | |

1996 | ||

2 | EE | Lowell W. Beineke, Peter Hamburger, William D. Weakley: Random packing by rho-connected rho-regular graphs. Discrete Mathematics 160(1-3): 41-47 (1996) |

1989 | ||

1 | EE | William D. Weakley:
On the number of C^{infinity}-words of each length.
J. Comb. Theory, Ser. A 51(1): 55-62 (1989) |

1 | Lowell W. Beineke | [2] |

2 | Peter Hamburger | [2] |

3 | Patric R. J. Östergård | [3] [4] |