Abstract
In this chapter, a banquet seating problem is described. The situation encountered in the problem can be naturally modeled by a graph and a vertex coloring of this graph. Such a vertex coloring, in turn, gives rise to other vertex colorings. The initial vertex coloring can be proper or not and, therefore, induces two different vertex colorings, which will be described in the following two chapters.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsAuthor information
Authors and Affiliations
Rights and permissions
Copyright information
© 2016 The Author
About this chapter
Cite this chapter
Zhang, P. (2016). A Banquet Seating Problem. In: A Kaleidoscopic View of Graph Colorings. SpringerBriefs in Mathematics. Springer, Cham. https://doi.org/10.1007/978-3-319-30518-9_12
Download citation
DOI: https://doi.org/10.1007/978-3-319-30518-9_12
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-30516-5
Online ISBN: 978-3-319-30518-9
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)