In principle, all sorts of characteristic classes carry obstructions to graph colorings. Here we shall look at the applications of Stiefel-Whitney classes associated to free involutions.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
(2008). Using Characteristic Classes to Design Tests for Chromatic Numbers of Graphs. In: Combinatorial Algebraic Topology. Algorithms and Computation in Mathematics, vol 21. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-71962-5_19
Download citation
DOI: https://doi.org/10.1007/978-3-540-71962-5_19
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-71961-8
Online ISBN: 978-3-540-71962-5
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)