Congressus Numerantium, المجلد 133

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