Abstract
Fig. 2.6 shows a rotation of K 5 which induces one single circuit. One may ask the more general question whether this is possible for K n . Applying Theorem 2.5 one can see that each rotation of K n induces an even number of circuits if n ≡ 3 or 0 (mod 4) and an odd number of circuits if n ≡ 1 or 2 (mod 4). Denote the vertices of K n by 0,1, 2,…, n−1 and consider the following rotation of K n .
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
© 1974 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Ringel, G. (1974). Related Problems. In: Map Color Theorem. Die Grundlehren der mathematischen Wissenschaften, vol 209. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-65759-7_12
Download citation
DOI: https://doi.org/10.1007/978-3-642-65759-7_12
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-65761-0
Online ISBN: 978-3-642-65759-7
eBook Packages: Springer Book Archive