## Proceedings of the fifteenth Southeastern Conference on Combinatorics, Graph Theory and Computing held at Louisiana State University, March 5-8, 1984, Volume 3 |

### What people are saying - Write a review

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

### Contents

H Niederhausen y | 5 |

Palem and D S Fussel | 18 |

J H Ristroph and C E Ashley | 27 |

Copyright | |

20 other sections not shown

### Common terms and phrases

activity adjacent aethod algorithm aove-to-front asyaptotic authentication system automorphism average bipartite bitog block coDP combinatorial Computer coNP construct contains Corollary corresponding cycle permutation graphs defined denote determine disjoint dominating set elements embedded encoding rule equivalent example exists Figure finite flag transitive maps given graph embedded graph G Graph Theory Hamiltonian hence holey SOLSSOM homeomorphic hyperedge hypergraph integer isomorphic labeled left-right paths Lemma length Let G m-gons makespan matched trees Math node NP-complete number of edges number of vertices obtained opponent oriented pair parameters parse tree partition permutation graphs planar graphs points polygons Proof RD-set rectangle resource type sample scheduling sequence series-parallel graph shortest paths shown signed graph single source problem SOLSSOM of type subset surface surjections symmetrical map Theorem transmitter triangles two-graph type 2n Venn diagram vertex W.T. Tutte weak records