ABSTRACT
The Southeastern Conference on Combinatorics, Graph Theory, and Computing has a long and important history. One of the many strengths of the conference has been its success in bringing together researchers engaged in developing deep and elegant combinatorial theory and researchers developing powerful algorithms with applications to practical problems. For fifty years, the conference has not only facilitated the application of elegant new theory, it has also leveraged applications to propose new and substantial theoretical questions. In this chapter, our goal is to explore one area in which this interplay between theory and application has been fruitful for both.
