Seating Rearrangements on Arbitrary Graphs


In this paper, we exhibit a combinatorial model based on seating rearrangements, motivated by some problems proposed in the 1990’s by Kennedy, Cooper, and Honsberger. We provide a simpler interpretation of their results on rectangular grids, and then generalize the model to arbitrary graphs. This generalization allows us to pose a variety of well–motivated counting problems on other frequently studied families of graphs.

9 Figures and Tables

Cite this paper

@inproceedings{Deford2013SeatingRO, title={Seating Rearrangements on Arbitrary Graphs}, author={Daryl Deford}, year={2013} }