We study the relationship between two sets S and S 0 of Coxeter generators of a finitely generated Coxeter group W by proving a series of theorems that identify common features of S and S 0 . We describe an algorithm for constructing from any set of Coxeter generators S of W a set of Coxeter generators R of maximum rank for W .A subset C of S is called complete if any two elements of C generate a finite group. We prove that if S and S 0 have maximum rank, then there is a bijection between the complete subsets of S and the complete subsets of S 0 so that corresponding subsets generate isomorphic Coxeter systems. In particular, the Coxeter matrices of .W; S/ and .W; S 0 / have the same multiset of entries.