Abstract
Homomorphisms and colorings of graphs are closely related. On the one hand, colorings are just homomorphisms into complete graphs. On the other hand, homomorphisms give rise to various generalizations of ordinary coloring concepts, like fractional colorings, circular colorings and odd colorings.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2024 The Author(s), under exclusive license to Springer Nature Switzerland AG
About this chapter
Cite this chapter
Stiebitz, M., Schweser, T., Toft, B. (2024). Homomorphisms and Colorings. In: Brooks' Theorem. Springer Monographs in Mathematics. Springer, Cham. https://doi.org/10.1007/978-3-031-50065-7_8
Download citation
DOI: https://doi.org/10.1007/978-3-031-50065-7_8
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-031-50064-0
Online ISBN: 978-3-031-50065-7
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)