Proceedings of the Southeastern Conference on Combinatorics, Graph Theory, and Computing, Volume 4Utilitas Mathematica Pub, 1973 - Combinatorial analysis |
Other editions - View all
Common terms and phrases
2-colorable 4TH S-E CONF abelian group adjacent algorithm array of order balanced incomplete block Baumert-Hall arrays bicritical binary bipartite graph block design boundary colorations braid chain-groups circuit Combinatorial Theory conjecture consider construction contains core cycle defined definition denote digits edges elements equation example exist finite four coloring given graph G Graph Theory Hadamard matrices hamiltonian Hamiltonian graphs Hence hypergraph incidence geometry incidence matrix incomplete block design integer isomorphic Jennifer Seberry Jennifer Wallis k-tuples labeled Lemma lower bound Math matroid maximal snakes minimal n-set nodes obtained occurs pair parameters partially ordered set partition perfect 1-factorization permutation permutation groups planar graph polynomial prime power problem PROC Proof reduced sequences Room square SAN DIEGO satisfy skew Stanton starter subcube subset Suppose symmetric snake T-sequence tactical configurations Theorem tree University upper bound values vertices wreath