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

2006 | ||
---|---|---|

8 | EE | Arthur H. Busch, Michael S. Jacobson, K. B. Reid: On arc-traceable tournaments. Journal of Graph Theory 53(2): 157-166 (2006) |

2005 | ||

7 | EE | K. B. Reid, E. DePalma: Balance in trees. Discrete Mathematics 304(1-3): 34-44 (2005) |

1995 | ||

6 | EE | K. B. Reid, Weizhen Gu: Plurality preference digraphs realized by trees - I. Necessary and sufficient conditions. Discrete Mathematics 147(1-3): 185-196 (1995) |

1992 | ||

5 | EE | K. B. Reid, Weizhen Gu: Plurality preference digraphs realized by trees, II: on realization numbers. Discrete Mathematics 101(1-3): 231-249 (1992) |

1991 | ||

4 | EE | K. B. Reid: The relationship between two algorithms for decisions via sophisticated majority voting with an agenda. Discrete Applied Mathematics 31(1): 23-28 (1991) |

1988 | ||

3 | EE | K. B. Reid: Bipartite graphs obtained from adjacency matrices of orientations of graphs. Discrete Mathematics 72(1-3): 321-330 (1988) |

1982 | ||

2 | EE | K. B. Reid: Every vertex a king. Discrete Mathematics 38(1): 93-98 (1982) |

1972 | ||

1 | K. B. Reid, Ezra Brown: Doubly Regular Tournaments are Equivalent to Skew Hadamard Matrices. J. Comb. Theory, Ser. A 12(3): 332-338 (1972) |

1 | Ezra Brown | [1] |

2 | Arthur H. Busch | [8] |

3 | E. DePalma | [7] |

4 | Weizhen Gu | [5] [6] |

5 | Michael S. Jacobson | [8] |