## Ars CombinatoriaDepartment 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.

### Contents

The kpath Packing and the kcovering Problems by GJ Chang | 11 |

Some Games of F Harary Based on Finite Groups by F W Barnes | 21 |

More on Local Motions by R Killgrove R W Sternfeld DJ Kiel | 31 |

Copyright | |

31 other sections not shown

### Common terms and phrases

3-connected abelian adjacent algorithm association scheme assume automorphism group bijection blocks cells chromatic polynomial columns Combinatorial complete complete graph components conjecture connected consider construction contains contradiction Corollary corresponding cycle defined degree digraph disjoint distinct edge labeling Edge Reconstruction element embedded exactly exists face configuration Figure finite fixed given graph G Graph Theory green Hamilton cycle hamiltonian Hence implies incell independent set induced irreducible isomorphic k-path large-degree Latin squares Lemma length Let G lines mapping Math matrix minimum modulo multiset number of edges obtained oriented matroid orthogonal pairs partition path pentagon permutation planar planar graph plane of order points polynomial prime problem projective plane Proof Proposition prove resp result satisfies segment sequence Steiner Steiner triple systems subgraph subgroup subplanes subset supercompact graph Suppose symmetric tactical decompositions terrace Theorem tree triangle vertex labeling vertices well-covered