## Ars Combinatoria, Volumes 26-27Department of Combinatorics and Optimization, University of Waterloo., 1988 - Combinatorial analysis |

### What people are saying - Write a review

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

### Other editions - View all

### Common terms and phrases

3-connected cubic graph 4-cycle 4-minimal graph 4-removable edges adjacent apply Lemma array automorphism balanced ternary belongs BIBD bicover of order bipartite bipartite graph codes column Combinatorial components consider construction contradiction Corollary coset cubic graph cycle-separating 4-edge cut define delete denote disjoint distinct elements exists Figure finite G contains gap sequence triple GBRD given graph G Graph Theory group divisible design Hadamard matrices Hence incidence matrix incomplete bicover induced integer isomorphic Jennifer Seberry Latin squares least Lemma Let G Math Mathematics matroid maximal minimal covers modular cut modulo number of vertices obtain occurs pair parameters partition perfect codes periodic gap sequence points prime implicants Proof Proposition result Seberry set of blocks Steiner Steiner triple systems subgraph subgroup subset Suppose symmetric tactical decomposition Theorem trees triangle triple system unique vectors vertex vertices of degree zero-hole