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 79
Page 121
... exists a PBD ( X , B ) of order v with a clear set of blocks GB such that each block in G belongs to the spectrum for OAC's and each of the remaining blocks of B belongs to the spectrum for idempotent OAC's , then there is an OAC of ...
... exists a PBD ( X , B ) of order v with a clear set of blocks GB such that each block in G belongs to the spectrum for OAC's and each of the remaining blocks of B belongs to the spectrum for idempotent OAC's , then there is an OAC of ...
Page 136
... exists two sources X and y If At step 2f ) which are predecessors of both b and Vi ax , ay , then by configuration C4 there exists arc ( a , v ̧ ) and a is a predecessor and again is a of Vi • Otherwise a = x or y predecessor of sources ...
... exists two sources X and y If At step 2f ) which are predecessors of both b and Vi ax , ay , then by configuration C4 there exists arc ( a , v ̧ ) and a is a predecessor and again is a of Vi • Otherwise a = x or y predecessor of sources ...
Page 139
... exists . If a 4 x , then arc ( a , d ) exists by configuration C3 . In both cases ( a , d ) will have colour i by lemma 3 . In step 2f ) , b and d have two common predecessors x and y . If x and y are a and c , arc ( a , d ) exists and ...
... exists . If a 4 x , then arc ( a , d ) exists by configuration C3 . In both cases ( a , d ) will have colour i by lemma 3 . In step 2f ) , b and d have two common predecessors x and y . If x and y are a and c , arc ( a , d ) exists and ...
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