Involve: A Journal of Mathematics
- Volume 7, Number 6 (2014), 787-805.
Seating rearrangements on arbitrary graphs
We exhibit a combinatorial model based on seating rearrangements, motivated by some problems proposed in the 1990s 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.
Involve, Volume 7, Number 6 (2014), 787-805.
Received: 4 November 2013
Revised: 3 January 2014
Accepted: 24 January 2014
First available in Project Euclid: 20 December 2017
Permanent link to this document
Digital Object Identifier
Mathematical Reviews number (MathSciNet)
Zentralblatt MATH identifier
Primary: 05C30: Enumeration in graph theory
DeFord, Daryl. Seating rearrangements on arbitrary graphs. Involve 7 (2014), no. 6, 787--805. doi:10.2140/involve.2014.7.787. https://projecteuclid.org/euclid.involve/1513733750