## Proceedings of the Southeastern Conference on Combinatorics, Graph Theory, and Computing, Part 3 |

### What people are saying - Write a review

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

### Other editions - View all

### Common terms and phrases

activity adjacent aethod algorithm authentication system automorphism average bijection bipartite bitog block coDP combinatorial Computer coNP construct contains Corollary corresponding cycle permutation graphs defined denote determine disjoint dominating set elements embedded encoding rule equivalent example exists Figure finite flag transitive maps given graph embedded graph G Graph Theory Hamiltonian hence holey SOLSSOM homeomorphic hyperedge hypergraph integer isomorphic labeled left-right paths Lemma length Let G m-gons makespan matched trees Math matrix node NP-complete number of edges number of vertices obtained opponent optimal strategy oriented pair parameters parse tree partition permutation graphs planar graphs points polygons polynomial Proof RD-set rectangle resource type sample scheduling sequence series-parallel graph shown signed graph single source problem SOLSSOM of type subset surface surjections symmetrical map Theorem transmitter triangles two-graphs type 2n Venn diagram vertex W.T. Tutte weak records