## Congressus Numerantium, Volume 137 |

### What people are saying - Write a review

We haven't found any reviews in the usual places.

### Contents

Doubly Nested Balanced Incomplete Block Designs | 5 |

Martin Polynomial Miscellanea | 19 |

Team Tournaments | 33 |

Copyright | |

9 other sections not shown

### Common terms and phrases

adjacent algorithm assume BCH codes bijective bijective proof binary trees chordal graphs Clique Problem column communication delay compDist(p component composite degree Computer consider construction Corollary corresponding critical graphs crown graph cut vertex deadlines denote diagonal flips domination number doubly nested BIBDs Dyck paths edge element Eulerian Eulerian graph exactly exists Figure FindPath flip-to-match diagonals given graph G Hadamard matrix Hamilton circuit Hamiltonian path Hence induced subgraph induction isometric subgraph l)-critical labeling Lemma Let G lower bound magic graph Martin polynomial minimum weight n-set n+2)-gon triangulations neighbour node Note obtain opposing teams orientation outerplanar graph parallel class partition path of length path property Peterson-type codewords players positive integer poui primitive polynomial processors Proof Proposition r-subspace recurrence result rotation round split-stars star graphs subspace Suppose tasks team tournaments Theorem tiles triangulation pair values vector vertex vertex-disjoint paths weak geometric dual Z-cyclic Zg Zg