The Second West Coast Conference on Combinatorics, Graph Theory, and Computing, University of Oregon, June 20-22, 1983Phyllis Zweig Chinn |
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
Other editions - View all
Common terms and phrases
1-factor 15 points 2-nodes adjacent algorithm arcs assignment problem b₁ BIBD blocks of size column Combinatorial complementary H(n,n+2 complementary Howell designs Computer connected construct contains Corollary cubic graph defined degree delays designs exist designs of side edge elementary abelian group elements exactly exists a GBRD Figure flow graph frequency 19 G₁ graph G Graph Theory Hadamard matrices Hence idle initial blocks integer Jennifer Seberry least Lemma lines of length lower bound LP relaxation matching immune graphs Math minimum multi-covering problems node obtained occurs open irredundant set optimal original message period points of frequency positive integer prime power Proof received the message result return a response Room square root rows S₁ S₂ Seberry sequence series-parallel networks skew frame step subtree polling Suppose Theorem Traveling Salesman Problem tree vertex West Coast Conference