## JCMCC: The Journal of Combinatorial Mathematics and Combinatorial Computing, Volumes 26-28 |

### What people are saying - Write a review

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

### Contents

On Packing Designs with Block Size 5 and index 7 21 | 3 |

On strong domination in graphs | 73 |

Undecidable Generalized Colouring Problems | 97 |

Copyright | |

9 other sections not shown

### Common terms and phrases

2-cliques 2-factors 4-cycles adjacent algorithm apply theorem array assume base sequences bowties cocyclic codes coloring column combinatorial designs complement graph complete conjecture connected graph construction contains contradiction copies of H3 Corollary cosets critical set cyclotomic defined denote design of order difference sets dimensional Discrete Math disjoint dominating set edges efc(S efficient dominating set Euclidean representation example exists Figure finite function generalised given graph G Hadamard matrices Hamiltonian Cycle Hamiltonian path Hence hole implies induced induced subgraph isomorphic latin squares Layered Hamiltonian Cycle Lemma Let G lower bound Mathematics matrix maximal independent set obtained optimal packing design pair paper parity graph partition permutation graph polynomial positive integer prime power prime vector problem Proof prove quartic graph quasigroup result rows satisfies Seberry Section string subgraph subgroup Suppose symbol transition layer triangle triple vertex vertex set vertices well-covered