## Congressus Numerantium, Volumes 70-71; Volume 1990 |

### What people are saying - Write a review

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

### Contents

Moreno and J Sotero Computational Approach to Conjecture A of Golomb | 7 |

J de Resmini Some Remarks on the Hall Plane of Order 16 | 16 |

S K Das P Mukherjee and I Sengupta | 29 |

Copyright | |

22 other sections not shown

### Other editions - View all

### Common terms and phrases

abelian group adjacency matrix algorithm assignment assume biembeddings binary bipartite graphs chromatic number cograph color Combinatorial competition graph complete bipartite graphs complete graph components Computer condition conjecture connected consider construction contains Corollary corresponding covering number cycle decomposition defined definition denote digraph eigenvalue elements example exists Figure finite graph G Graph Theory Hence hypergraph immune implies induced induced subgraph integer interval graph irredundance isomorphic Knut Vic designs label Latin square Lemma length Let G linear Math maximum degree minimum modulo monochromatic multigraph N-arc node number of vertices obtain outerplanar pair Paley graph path poset positive integers prime problem proved RBD(n RBG(n result satisfies smallest spanning eulerian subgraph spanning tree Steinhaus graph strong complete mappings Subcase subset subset-sums sum graph Suppose Sylow templates Theorem triangle vertex vertex of degree vertex set vertices of G x-avoiding circular sequence