## The second West Coast Conference on Combinatorics, Graph Theory, and Computing, University of Oregon, June 20-22, 1983 |

### From inside the book

4 pages matching **Traveling Salesman Problem** in this book

#### Page 5

#### Page 307

Where's the rest of this book?

Results 1-3 of 4

### What people are saying - Write a review

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

### Contents

G A Cheston and S T Hedetniemi | 7 |

Neufeld and C J Colbourn | 21 |

S Judah and R C Mullin | 27 |

Copyright | |

13 other sections not shown

### Common terms and phrases

1-factor 14 points 2-nodes 2-trees adjacent algorithm apply Theorem arcs array assume blocks of size column Combinatorial complementary Howell designs complete graphs complexity measure Computer connected construct contains Corollary cubic graph cyclomatic complexity defined degree delays designs exist edge elementary abelian group elements exactly Figure finite linear space flow graph frequency 19 graph G Graph Theory Hadamard matrices Hence IB(v idle initial blocks integer Jennifer Seberry largest subtree Lemma lines of length lower bound LP relaxation matching immune graphs Math minimal minimum multi-covering problems neighbor node obtained occurs open irredundant set optimal original message period points of frequency positive integer precisely prime power Proof received the message result return a response root rows Seberry sequence series-parallel networks skew frame spT(G step subtree polling Suppose Theorem Traveling Salesman Problem tree two-commodity vertex vertices West Coast Conference