## Proceedings of the 1985 Southeastern Conference on Combinatorics, Graph Theory and Computing Held at Sundance, Utah, Under the Auspices of the Mathematics Department, Brigham Young University August 1,2,3, 1985 |

### What people are saying - Write a review

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

### Contents

Kantor A Brief Summary of Generalized Polygons | 7 |

Steve Wilson A Construction from an Existence Proof | 25 |

Wimer S T Hedetniemi and R Laskar A Methodology | 43 |

Copyright | |

13 other sections not shown

### Common terms and phrases

2-cohesive spanning subgraph adjacency split adjacent vertices assume Aut(B bandwidth bipartite graph broadcast color columns combinatorial complete graph conditional chromatic number conjecture connected consider constructed contains corresponding cyclic defined degree denote determine digit digraph distributed algorithms edge-graceful labeling event structure example exists families of graphs Figure finite fundamental cycle graph G Graph Theory greedy algorithm H-coloring Hedetniemi Hence hypergraph independent induced subgraph isohedral isomorphic labeling least Lemma length Let G linear algorithms manual Math Mathematics maximum mbn's messages minimum monohedral tiling node NP-complete number of edges number of vertices obtain operations pairs parse tree partition path planar graph points polynomial positive integer problem processor Proof prototlle pseudosurface result rooted tree series-parallel graphs series-parallel networks spanning tree subgraph of G subset super vertex symmetry group Theorem triangle unimodal function Young tableau zeros