## Ars Combinatoria, Volumes 19-20Department of Combinatorics and Optimization, University of Waterloo., 1985 - Combinatorial analysis |

### What people are saying - Write a review

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

### Contents

Construction of 32lCOILS | 3 |

The Shape of Minimum Blocking Sets in Small Planes by J W DiPaola 15 | 15 |

A Theorem of the NordhausGaddum Class by T Watkinson 35 | 35 |

Copyright | |

17 other sections not shown

### Other editions - View all

### Common terms and phrases

3-connected adjacent algorithm array assume automorphism balanced ternary bipartite graph bound cell CG(x column Combinatorial complete graph completes the proof component conjecture consider construction contradiction Corollary corresponding cubic graph cycle cyclic decomposition defined delete denote diameter digraphs disjoint distinct edges of G elements exactly exists Figure finite G contains given graph G Graph Theory Hadamard Hadamard matrix hamiltonian Hence induced subgraph integer intersection isomorphic least Lemma Let G Math Mathematics matrix matroids minimal minimum modulo nodes number of edges number of vertices orbits orthogonal Latin squares pair parallel class partition path of length permutation Petersen graph planar graph plane of order points positive integer Proposition prove result satisfies sequence solution split graph square of order Steiner triple system subgraph of G subset Suppose symbol Theorem Theorem 3.1 tree triangle Tuscan Square vertex vertex of degree