8 pages matching maximum degree in this book
Results 1-3 of 8
What people are saying - Write a review
We haven't found any reviews in the usual places.
The ArkinSmith construction on pairs of orthogonal latin squares of order
The Rank of a Graph After Edge Insertion or Deletion by George J Davis
7 other sections not shown
1-locally distinguish adjacent arcs augmenting path basic variables bound chromatic index chromatic polynomial cograph colors column combinatorial complete graph complete level consider constraints copies of Tj cost coefficients current SP cycle defined denote elements enumerator polynomial example exist final tableau finite given matrix graph G graph structure Graph Theory induced subgraph integer intersection isomorphic labeling Lemma Let G level 3 cotree level-1 linear code linear programming Math Mathematics matroid maximum degree nodes number of vertices obtained optimal solution optimal vertex overfull pairs partition perturbation pivoting polyominoes Proof Pull phase Push phase Push-and-Pull algorithm rank Remove an edge self-complementary degree sequences sensitivity analysis shortest path shortest path problem simplex method Smith normal form solution algorithm SP problem stable extension starter 1-factorization starter construction Step subgraph symmetric tolerance Theorem Theory tolerance analysis twisted even starter values vector vertex colored zero