| |
| 2001 | ||
|---|---|---|
| 4 | Pak-Ken Wong: An Algorithm for Finding Longest Cycles in Certain Bipartite Graphs. Int. J. Found. Comput. Sci. 12(4): 445-454 (2001) | |
| 1999 | ||
| 3 | EE | Pak-Ken Wong: Optimal Path Cover Problem on Block Graphs. Theor. Comput. Sci. 225(1-2): 163-169 (1999) |
| 1979 | ||
| 2 | EE | M. O'Keefe, Pak-Ken Wong: A smallest graph of girth 5 and valency 6. J. Comb. Theory, Ser. B 26(2): 145-149 (1979) |
| 1977 | ||
| 1 | EE | Pak-Ken Wong: A note on a paper of G. Wegner. J. Comb. Theory, Ser. B 22(3): 302-303 (1977) |
| 1 | M. O'Keefe | [2] |