Proceedings of the Fifteenth Southeastern Conference on Combinatorics, Graph Theory and Computing Held at Louisiana State University, March 5-8, 1984. |
Contents
H Niederhausen v | 5 |
Palem and D S Fussel | 13 |
Paoli and W T Trotter | 19 |
Copyright | |
26 other sections not shown
Common terms and phrases
activity algorithm asymptotic cost authentication system automorphism average bijection bitog block C₁ coDP combinatorial Computer coNP construction contains Corollary corresponding cycle permutation graphs defined denote determine disjoint dominating set embedded encoding rule equivalent example exists Figure finite flag transitive maps G₂ given graph embedded graph G Graph Theory H(IMS Hamiltonian Hamiltonian cycle hence holey SOLSSOM hyperedge hypergraph integer isomorphic labeled left-right paths Lemma length m-gons makespan matched trees Math move-to-front node NP coNP NP-complete number of edges number of vertices O(nlogn obtained optimal strategy oriented pair parameters partition permutation graphs planar graphs points polygons Proof RD-set resource type sample scheduling sequence series-parallel graph signed graph SOLSSOM of type subgraph subset surface surjections symmetrical map Theorem transmitter triangles two-graph v¹¹ v¹º Venn diagram vertex W.T. Tutte weak records