## JCMCC: The Journal of Combinatorial Mathematics and Combinatorial Computing, Volumes 21-22 |

### What people are saying - Write a review

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

### Contents

Logarithms Syndrome Functions and the Information Rates of Greedy Loop | 33 |

Complexity of Scheduling Problems With Generalized Due Dates | 51 |

On a Conjecture Concerning Selfconjugate Selforthogonal Diagonal Latin Squares | 65 |

Copyright | |

13 other sections not shown

### Other editions - View all

### Common terms and phrases

1-factor ADHP adjacent algorithm array assume automorphism B-array blocks BPTD chordal graph closed quasiorder coatoms column Combinatorial compact spaces complete graph computation connected graph consider constraint construction contains contradiction Corollary cycle of length cyclic define denote digraph disjoint edge-integrity elements equivalence relations exactly exists factors Figure finite fixed point function geodetic given graph G Graph Theory grid graph Hamiltonian circuits Hamiltonian Paths Hence homeomorphic implies incidence matrix independent set induced subgraph integer intersection isomorphic lattice least Let G mapping Math matrix maximum degree modular Nc(v nodes NP-Complete number of vertices obtained odd components optimal orthomorphism pair pancyclic parallel classes part-column partition path permutation prime problem processors Proof prove quasiorder resolution class satisfying simplex simplicial special near orthomorphism split graph subset Suppose tangent Theorem 1.2 Theory tournament transitive V(GA vector vertex vertex set vertices of degree weight