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

### 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

Moreno and J Sotero Computational Approach to Conjecture A of Golomb | 7 |

J de Resmini Some Remarks on the Hall Plane of Order 16 | 16 |

S K Das P Mukherjee and I Sengupta | 29 |

Copyright | |

22 other sections not shown

### Other editions - View all

### Common terms and phrases

2-connected abelian group adjacency matrix adjacent algebra algorithm assume automorphism binary chromatic number clique cograph color column combinatorial competition graph complete graph components Computing conjecture connected consider construction contains contradiction convex lattice polygon Corollary cycle decomposition defined definition denote diameter difference set digraph eigenvalues elements equivalent example exists Figure finite function graph G Graph Theory hamiltonian hamiltonian path Hence hypergraph implies independence number induced induced subgraph inequality input integer interior lattice points intersection interval graph isomorphic Knut Vic designs label Latin square lattice points least Lemma length Let G level structure linear Math matrix matroid minimal minimum modulo node Note number of vertices obtained pair path permutation planes of order poset positive integers prime problem Proof Proposition prove result satisfies strong complete mappings subset sum graph Suppose Theorem tree triangle unique vertex vertex of degree