Proceedings of the Southeastern Conference on Combinatorics, Graph Theory, and Computing, Volume 14Utilitas Mathematica Pub, 1983 - Combinatorial analysis |
From inside the book
Results 1-3 of 83
Page 47
... elements of the upper halves are c + l , ... , c + n - 1 , and the elements in the middle rows of odd - sized components are c + s , ... , c + l - 1 . Critical PSDS with c = 1 have been studied in [ 3 ] . It follows from the above ...
... elements of the upper halves are c + l , ... , c + n - 1 , and the elements in the middle rows of odd - sized components are c + s , ... , c + l - 1 . Critical PSDS with c = 1 have been studied in [ 3 ] . It follows from the above ...
Page 55
... elements , and since the number of odd elements in { 1,2 , ... , 12 } is 6 , each component must contain three odd and three even elements . Then each component has one of the following two forms , where ɛ and w denote even and odd ...
... elements , and since the number of odd elements in { 1,2 , ... , 12 } is 6 , each component must contain three odd and three even elements . Then each component has one of the following two forms , where ɛ and w denote even and odd ...
Page 448
... elements of S such that every ordered pair of elements of S belongs to exactly one cyclic triple in T. A cyclic triple is a set of three ordered pairs of distinct elements with the property that an element occurs as the first element of ...
... elements of S such that every ordered pair of elements of S belongs to exactly one cyclic triple in T. A cyclic triple is a set of three ordered pairs of distinct elements with the property that an element occurs as the first element of ...
Contents
Pomerance | 21 |
J Abrham A Kotzig and P J Laufer | 45 |
O Albertson and D M Berman | 69 |
Copyright | |
17 other sections not shown
Other editions - View all
Common terms and phrases
2-extensors adjacent algorithm array bipartite blocks cograph color column Combinatorial complete complete graph component Computing configuration CONGRESSUS NUMERANTIUM conjecture construction contains Corollary corresponding cosets cycle cyclic defined denote digraph directed graph disjoint edge of H elements embedded Eulerian circuit example exists Figure finite function G₁ G₂ given Goppa codes graph G Graph Theory Hence hypergraph inequalities integer intersection irreducible isomorphic k-connected graphs k-subset Ker G labelled latin squares Lemma length Let G linear mapping Math Mathematics matrix matroid maximal maximum minimal minimum mission network nodes NP-complete obtained operations pair paper partition path perfect graphs permutation plane points polynomial problem Proof prove PSDS randomly bitraceable result satisfying sequence Southeastern Conference subgraph subset symmetric Theorem tiles Transitive triple tree triangle triple system University upper bound values variables vector vertex vertices