Search the dblp DataBase
William D. Weakley: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]
Publications of Author
- Patric R. J. Östergård, William D. Weakley
Values of Domination Numbers of the Queen's Graph. [Citation Graph (0, 0)][DBLP]
Electr. J. Comb., 2001, v:8, n:1, pp:- [Journal] - Patric R. J. Östergård, William D. Weakley
Constructing Covering Codes with Given Automorphisms. [Citation Graph (0, 0)][DBLP]
Des. Codes Cryptography, 1999, v:16, n:1, pp:65-73 [Journal] - William D. Weakley
Upper bounds for domination numbers of the queen's graph. [Citation Graph (0, 0)][DBLP]
Discrete Mathematics, 2002, v:242, n:1-3, pp:229-243 [Journal] - William D. Weakley
Erratum to "Upper bounds for domination numbers of the queen's graph": [Discrete Mathematics 242 (2002) 229-243]. [Citation Graph (0, 0)][DBLP]
Discrete Mathematics, 2004, v:277, n:1-3, pp:321-0 [Journal] - William D. Weakley
On the number of Cinfinity-words of each length. [Citation Graph (0, 0)][DBLP]
J. Comb. Theory, Ser. A, 1989, v:51, n:1, pp:55-62 [Journal] - Lowell W. Beineke, Peter Hamburger, William D. Weakley
Random packing by rho-connected rho-regular graphs. [Citation Graph (0, 0)][DBLP]
Discrete Mathematics, 1996, v:160, n:1-3, pp:41-47 [Journal]
Search in 0.001secs, Finished in 0.001secs
| NOTICE1 |
|---|
| System may not be available sometimes or not working properly, since it is still in development with continuous upgrades |
| NOTICE2 |
|---|
| The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP |
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002