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

### What people are saying - Write a review

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

### Contents

a 1 1 0 0 0 0 1 0 0 | 32 |

VOLUME | 82 |

b 1 0 0 1 0 0 0 0 0 | 92 |

Copyright | |

47 other sections not shown

### Other editions - View all

### Common terms and phrases

acyclic adjacent approximation algorithm assignment assume biclique binary bipartite graph cell clique color colour schemes Combinatorial competition graph complete graph component Computer configuration conjecture consider construct contains Corollary decomposition defined definition degree denote digraph disjoint dominant edge dominating set domination number eB(y elements example exists Figure finite follows function given graph G Graph Theory grid graph hamiltonian hamiltonian cycle Hence hypercube induced induced subgraph integer interval graphs labeled Latin square least Lemma linear lower bound Math matrix matroid maximal convertible maximum number minimum niche graph niche number nodes NP-complete number of vertices obtained optimal pair partition permutation planar graph polynomial problem Proof quadtree result root route satisfies sequenced basis set sequence shortest path sign-nonsingular solution Steiner triple systems subgraph subset subtrees support sets Suppose t-clique Theorem token queue token request tournament traffic vector vertex Vizing's conjecture worst-case performance