## Congressus Numerantium, Volumes 78-79; Volume 1990 |

### What people are saying - Write a review

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

### Contents

J W Brown 57 6Sets on 46 points with no Pair of Points Repeated | 11 |

H H Ali A Boals and N A Sherwani Generalized Load Balancing Graphs | 17 |

Q Yu tMatching Covers and Degrees | 27 |

Copyright | |

19 other sections not shown

### Common terms and phrases

adjacent algebra algorithm assume binary binomial type bound chromatic number clique clique-tree cograph color Combinatorial complete graph component component-reducible connected graph consider construct contains contradiction Corollary corresponding cube-connected cycles cutset cycle defined definition deleting denote disjoint distance dominating set dual point elements embedding equivalence example exists Figure function G and H given GMS problem graph G graph of order Graph Theory Hence hypercube hypergraph induced induced subgraph intersection intersection graph Lemma length Let G linear extensions load balancing matching Math maximum metric minimum modulo multigraph neighborhood node NP-complete number of edges obtained optimal oriented graph pair partition perfect dominating sets perfect graphs permutation planar graphs plane polynomial positive integer proof of Theorem properties Proposition prove result root satisfy sequence shortest path spanning tree string strongly regular graphs subgraph subset Suppose Sylow subgroup tournament tree-realizable triangle vertex set