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

### What people are saying - Write a review

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

### Related books

Introduction to Design & Analysis of Algorithms: For Anna University, 2/e Anany V. Levitin No preview available - 2009 |

### Contents

Pomeranee | 21 |

J Abrham A Kotzig and P J Laufer | 45 |

B A Anderson | 75 |

Copyright | |

16 other sections not shown

### Other editions - View all

### Common terms and phrases

2-extensors adjacent algorithm array assume bifactorization binary blocks cograph color column Combinatorial complete complete graph component Computing configuration CONGRESSUS NUMERANTIUM conjecture consider construction contains Corollary corresponding cosets cycle cyclic defined denote determine digraph directed graph disjoint distance edge of H elements embedded Eulerian circuit example exists Figure finite function given Goppa codes graph G Graph Theory Hence hypergraph implies induced subgraph inequalities integer intersection irreducible isomorphic k-subset Ker G labelled latin squares Lemma length Let G linear mapping Math Mathematics matrix matroid maximal maximum minimal minimum mission network nodes NP-complete obtained operations pair paper partition path perfect graphs permutation plane polynomial problem Proof prove PSDS quasigroup quasiperfect randomly bitraceable result satisfying sequence Southeastern Conference step subgraph subset Suppose symmetric Theorem tiles tree triangle upper bound values variables vector vertex vertices