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

### What people are saying - Write a review

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

### Contents

G W Hopkins and W A Staton | 5 |

T A McKee | 11 |

S T Dean W T Jones and C C Yang | 19 |

Copyright | |

12 other sections not shown

### Common terms and phrases

2-regular algorithm amida anxb assume balanced binary trees bipartite graph block graph blue adjacencies blue Wg circular system cocycles complete graph Computing constraints construction contains contradiction convex convex geometry convex sets corresponding cycle cyclic triples defined denote digraph discs element embedded equations evolutionary trees exponential generating function Figure finite follows function graceful graph G Graph Theory Harary Hence implies inequalities input isomorphism L-matrix labelled latin squares Lemma Let G Math matrix maximal Mendelsohn triple systems minimum number modulo natural number nodes number of vertices obtain pair parameters partial Mendelsohn triple partition Petersen graph planar mesh player points polynomials poset problem Proof Proposition red adjacencies red edges regular graphs result RG+(A semilattice sequence signed graph snarks solved step storage tape string trees subgraph Suppose symbols Theorem topological sort tree path triangle Turing machine unsatisfied equalities values vertex vertices of degree Wg with center