## Proceedings of the Southeastern Conference on Combinatorics, Graph Theory, and Computing, Volume 13 |

### What people are saying - Write a review

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

### Contents

P ErdBs | 3 |

A F Alameddlne | 19 |

Alexander G Hopkins and W Staton | 33 |

Copyright | |

33 other sections not shown

### Common terms and phrases

5-vertices adjacency matrix algorithm array assignment assume binary tree bipartite blocks Bruijn sequence called carrier coloring Combinatorics common neighbor Computing Conference on Combinatorics CONGRESSUS NUMERANTIUM conjugates consider construction contains Corollary corresponding cost defined denote digraph disjoint disk distance elements embedding exactly example exists Figure finite function fundamental cycle given graph G Graph Theory Grundy number Hence hypercodes hypergraph implies impossible paths induced intersection interval graph ISBN isomorphic k-tree latin square least Lemma Let G linear Manitoba maps Math Mathematics matrix maximal minimum NLFSR node Note NP-complete obtained outerplanar graphs pair partition permutation planar planar graphs polynomial problem Proof prove quadrangle quasigroup random graph result Room square shipper Southeastern Conference span Steiner Steiner tree subgraph subsets subsquare Suppose Theorem tolerance graph triangle-free graph truth table unique University upper bound values vertex vertices of degree wrapped covering