## Ars Combinatoria, Volume 23, Part 2Department of Combinatorics and Optimization, University of Waterloo., 1987 - Combinatorial analysis |

### What people are saying - Write a review

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

### Contents

Inclusionexclusion Formulae without Higher Terms by L A Szekely | 7 |

Applications of Graph Theory by L Caccetta and K Vijayan | 21 |

Cycles Through Seven Vertices Avoiding One Edge in 3connected | 79 |

Copyright | |

7 other sections not shown

### Common terms and phrases

3-connected cubic graph absolute points adjacency matrix adjacent algorithm Applications of Graph automorphism balanced ternary BIBD bicliques branching index Caccetta codewords Combinatorial completed graph Comput consider construction containing Corollary corresponding cyclability cycle in G denote diameter directed graph disjoint distance criterion distance property exist finite projective plane given graph Figure graph G Graph Isomorphism Graph Theory Hadamard matrix hamiltonian Hamming code Harary Hence hypergraph IEEE Trans initial blocks integer intersection joined labelled Lemma Let G level-1 lines maps Math Mathematics matrix of order maximal outerplanar graph minimum number Moore graphs number of vertices optimal orthodox joint embedding orthogonal designs pair parameters partition path graph Petersen graph problem Proof quasispreads R. J. Wilson reach 12 resolution classes result root Seberry shown in Figure spanning tree spread structure subdesigns subgraph subtree of T-u tactical decomposition Theorem triangles triples vertex vertices of degree