Proceedings of the Southeastern Conference on Combinatorics, Graph Theory, and Computing, Volume 3Utilitas Mathematica Pub - Combinatorial analysis |
From inside the book
Results 1-3 of 51
Page 179
... determine from an ALIAS the particular canonical form that is the NAME of the graph is , in general , a problem requiring a computer . The Traverser The Traverser attempts to find the longest path in a graph , or one of the longest ...
... determine from an ALIAS the particular canonical form that is the NAME of the graph is , in general , a problem requiring a computer . The Traverser The Traverser attempts to find the longest path in a graph , or one of the longest ...
Page 285
... Determine the set of maximal condensible cliques and independent sets in G. By Lemmata 3.2 and 3.3 , no two of these intersect . If If we only have the vertex graph , we are finished . If Step 1 produced no subgraphs , go to Step 3 ...
... Determine the set of maximal condensible cliques and independent sets in G. By Lemmata 3.2 and 3.3 , no two of these intersect . If If we only have the vertex graph , we are finished . If Step 1 produced no subgraphs , go to Step 3 ...
Page 341
... DETERMINE THE KNOT FROM WHICH WE COMPUTE THE APPROXIMATIONS . K = ( TIP - DP ) / H + 1 C DETERMINE THE TOTAL NUMBER OF KNOTS USED , NOM . NOM = ( EP - DP ) / H + 1 C OBTAIN THE STARTING APPROXIMATE SOLUTION . 50 60 DO 50 I = 1 , NOM T ...
... DETERMINE THE KNOT FROM WHICH WE COMPUTE THE APPROXIMATIONS . K = ( TIP - DP ) / H + 1 C DETERMINE THE TOTAL NUMBER OF KNOTS USED , NOM . NOM = ( EP - DP ) / H + 1 C OBTAIN THE STARTING APPROXIMATE SOLUTION . 50 60 DO 50 I = 1 , NOM T ...
Other editions - View all
Common terms and phrases
3RD S-E CONF a₁ adjacent algebra algorithm approximation average number b-line block design CALIFORNIA cell Chromatic Polynomial closed braids coloration COMBINATORICS congruent number contains Corollary crossing number cycle defined denote Diophantine equation elements endpoints equation ERSITY exist factor Figure finite function given graph G GRAPH THEORY hashing Hence hypohamiltonian graphs hypotraceable graph integer KNOT label Latin squares lattice Lemma linear major rotation Math matrix matroid method minimal modulo n-coloring nodes number of edges number of probes obtained occur odd chords P,Q)-homomorphism P,Q)-system pair partial cut partition planar graph polynomial prime problem PROC Proof quadratic Room square secondary flat solution solve spanning path spline square free squares of side subgraph of G subsets tree edge type S Latin uniform edges UNIVERSITY University of Manitoba University of Waterloo V₁ values vector vertex ду