Congressus Numerantium, المجلد 137

adjacent algorithm assume BCH codes bijective bijective proof binary trees chordal graphs Clique Problem communication delay component composite degree Computer consider construction Corollary corresponding critical graphs crown graph deadlines denote diagonal flips domination number doubly nested BIBDs Dyck paths edge element Eulerian Eulerian graph Figure FindPath flip-to-match diagonals given graph G H₁ Hadamard matrix Hamilton circuit Hamiltonian path Hence induced induced subgraph isometric subgraph k₁ labeling Lemma Let G lower bound magic graph Martin polynomial minimum weight mod 2t n-set n+2)-gon triangulations neighbour node Note NP-complete obtain opposing teams orientation outerplanar graph parallel class partition path of length path property Peterson-type codewords players positive integer primitive polynomial processors Proof Proposition r-flats r-subspace recurrence result round s₁ split-stars star graphs subspace Suppose t)-critical t₁ t₂ team tournaments Theorem tiles triangulation pair v₁ values vector vertex vertex-disjoint paths weak geometric dual Z-cyclic