This project focuses on providing a maximum degree of an Error graph for which locatability can be assured. Previous research has examined the maximum size of error graphs as well the tripartite graph has also been characterized. However we look at the maximum degree of a locatable error graph with an arbitrary number of parts of arbitrary order. A novel algorithm can be used to create a passing row in PTIME given appropriate constraints.