Congressus Numerantium, Volume 133Utilitas Mathematica Pub. Incorporated, 1970 - Combinatorial analysis |
From inside the book
Results 1-3 of 46
Page 19
... Consider T ( m , 3 ; 2 ) and L2 as in the first case . Instead of considering three cycles in L2 , we consider only the first two . Take one additional point 001. Join it to vi , 3 ( i - 1 ) +3 , 1 ≤ i ≤ m . Now there are 2m points ...
... Consider T ( m , 3 ; 2 ) and L2 as in the first case . Instead of considering three cycles in L2 , we consider only the first two . Take one additional point 001. Join it to vi , 3 ( i - 1 ) +3 , 1 ≤ i ≤ m . Now there are 2m points ...
Page 32
... Consider the cycle C , on vertices numbered 1 through 8 , with a single edge added between vertices 1 and 4. As shown in the next section , the rank of this graph is 8. Remove the edge from vertices 1 to 4 , C remains , and the rank has ...
... Consider the cycle C , on vertices numbered 1 through 8 , with a single edge added between vertices 1 and 4. As shown in the next section , the rank of this graph is 8. Remove the edge from vertices 1 to 4 , C remains , and the rank has ...
Page 109
... consider the permutation p defined by p ( x ) = x + 1 for x in Z2m , or in other words p ( 0 1 2 ... 2m - 1 ) . We let this act on the vertices of K2n in the obvious way with p ( ∞ ; ) = ∞¡ . We may think of the powers p * of p as ...
... consider the permutation p defined by p ( x ) = x + 1 for x in Z2m , or in other words p ( 0 1 2 ... 2m - 1 ) . We let this act on the vertices of K2n in the obvious way with p ( ∞ ; ) = ∞¡ . We may think of the powers p * of p as ...
Contents
The ArkinSmith construction on pairs of orthogonal latin squares of order | 14 |
Local conditions for edgecolouring of cographs | 45 |
Defective Chromatic Polynomials by Lenore J Cowan | 57 |
Copyright | |
9 other sections not shown
Other editions - View all
Common terms and phrases
1-locally distinguish A₁ adjacent augmenting path automorphism bound c₁ chromatic index chromatic polynomial cograph colors column combinatorial complete graph complete level computation consider constraints cost coefficients current SP cycle defined denote e₁ elements enumerator polynomial example exist Figure final tableau finite G₁ given matrix graph G graph structure Graph Theory induced subgraph integer intersection isomorphic labeling Lemma Let G level 3 cotree level-1 limited snakes linear code linear programming Math Mathematics matroid nodes obtained operations optimal solution optimal vertex overfull pairs perturbation pivoting polyominoes Proof Pull phase Push phase Push-and-Pull algorithm rank red(E self-complementary degree sequences sensitivity analysis shortest path shortest path problem Smith normal form solution algorithm SP problem stable extension starter 1-factorization starter construction Step subgraph Theorem Theory tolerance analysis twisted even starter V₁ values vector vertex colored vertices of degree Z-cyclic zero