## Ars Combinatoria, Volumes 64-65Department of Combinatorics and Optimization, University of Waterloo., 2002 - Combinatorial analysis |

### What people are saying - Write a review

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

### Contents

New Series of Dudeney Sets for p + 2 Vertices by Midori Kobayashi | 3 |

Radio Labelings of Cycles by Ping Zhang | 21 |

Which Graphs Have Hall Number Two? | 39 |

Copyright | |

13 other sections not shown

### Common terms and phrases

5ECS 6-cycle system adjacent algorithm assume avoidable sets binary tree Bishops block c-ary combinatorial complete graph congruence connected consider construction contains contradiction Corollary critical graphs critically imperfect define denote digraph edge Edge-Weights Covered eigenvalues embedding exactly extended 5-cycle Figure graph G Graph Theory Hall number Hamilton cycle Hence idempotent elements Let implies induced subgraph integer isomorphic latin interchange latin square lattice least element Lemma Let G Math Mathematics matrix matroid minimal coloring minimum modular lattice modulo obtained orthogonal pair parameters partial latin square partition path PBDCB design planar polynomial positive integer potentially Cs-graphic proof of Theorem Proposition prove quasigroup radio labeling received label result saturated sets self-complementary graphs sequence set of vertices squag Stirling numbers Sub-part Subcase subset super edge-magic labeling Suppose Theorem Theorem 3.1 total domination triple vectors vertex vertex of degree vertex set