## Proceedings of the Southeastern Conference on Combinatorics, Graph Theory, and Computing, Volume 23Utilitas Mathematica Pub, 1992 - Combinatorial analysis |

### What people are saying - Write a review

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

### Contents

Amiya Nayak Linda Pagli and Nicola Santoro Combinatorial and Graph | 7 |

Robert J Cimikowski Graph Planarization and Skcwncss | 21 |

Rcntena and II TapiaRecillas Some ArtinSchrcicr codes and Ideals | 57 |

Copyright | |

10 other sections not shown

### Other editions - View all

### Common terms and phrases

2-spanner adjacent algorithm array assume automorphism bandwidth block Boolean cell chord clique codes color column combinatorial comparability graph complete mappings components consider construction contains contradiction Corollary corresponding cycle defined denote digraph disjoint maximum independent dominating set elements exists extend to disjoint face configuration fault pattern finite fractional coloring given graph G Graph Theory Halin graph Hamilton path Hamiltonian Hamiltonian path Hence induced subgraph isomorphic labels Lemma Let G linear lower bound Math matrix maximal maximum independent sets minimal minimum nodes NP-complete number of edges obtained optimal pair pairable partition permutation graph planar graph points polynomial positive integer problem Proof RCCC result schedule sequence sets in G shown in Figure spanning tree square strongly preserves subset subtree Suppose Theorem Traveling Classes tree spanner unate function unique vector vertex vertex of degree visibility graph weight