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 8
Page 409
... spanning path , but , for each vertex V of G , the maximal subgraph of G not containing ν ( denoted G - v ) has a spanning path ? This problem also appeared as a research problem in the Monthly ( see Kronk [ 4 ] ) . A similar problem ...
... spanning path , but , for each vertex V of G , the maximal subgraph of G not containing ν ( denoted G - v ) has a spanning path ? This problem also appeared as a research problem in the Monthly ( see Kronk [ 4 ] ) . A similar problem ...
Page 415
... spanning path P1 in G - V1 are in C1 ( b ) both are in C2 . Let P2 be a spanning path in G - v so that P2 C is a spanning path in C1 n n 1 P2 C2 is a spanning path in C2 ending in the path ( P2 C1 ) ( v1v , v2 ) 1 path in G. " ' In case ...
... spanning path P1 in G - V1 are in C1 ( b ) both are in C2 . Let P2 be a spanning path in G - v so that P2 C is a spanning path in C1 n n 1 P2 C2 is a spanning path in C2 ending in the path ( P2 C1 ) ( v1v , v2 ) 1 path in G. " ' In case ...
Page 416
... spanning path P1 in G - v is such that ( PC ) is a spanning path of C2 ending at W2 ° A spanning path P2 in G - v2 is such that ( P2 ~ C1 ) " ' ( v1v , w1 ' ) is a spanning path in C1 ending at พา or W1 ' say W1 . Then path ( P2 ^ C1 ) ...
... spanning path P1 in G - v is such that ( PC ) is a spanning path of C2 ending at W2 ° A spanning path P2 in G - v2 is such that ( P2 ~ C1 ) " ' ( v1v , w1 ' ) is a spanning path in C1 ending at พา or W1 ' say W1 . Then path ( P2 ^ C1 ) ...
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 ду