Abstract
Presented here are necessary and sufficient conditions for a cubic graph equipped with a Tait-coloring to have a drawing in the real projective plane where every edge is represented by a line segment, all of the lines supporting the edges sharing a common color are concurrent, and all of the supporting lines are distinct.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Agol, I., Hass, J., Thurston, W.: The computational complexity of knot genus and spanning area. Trans. Amer. Math. Soc. 358(9), 3821–3850 (2006), (electronic), http://dx.doi.org/10.1090/S0002-9947-05-03919-X
Biggs, N.: Algebraic graph theory. cambridge Tracts in Mathematics, vol. 67, Cambridge University Press, London (1974)
Björner, A., Vergnas, M.L., Sturmfels, B., White, N., Ziegler, G.M.: Oriented Matroids, 2nd edn. Cambridge University Press, Cambridge (2000)
Bonnington, C.P., Little, C.H.C.: The Foundations of Topological Graph Theory. Springer, New York (1995)
Eppstein, D.: The topology of bendless three-dimensional orthogonal graph drawing. In: Tollis, I.G., Patrignani, M. (eds.) GD 2008. LNCS, vol. 5417, pp. 78–89. Springer, Heidelberg (2009)
Eppstein, D., Mumford, E.: Steinitz theorems for orthogonal polyhedra (December 2009) arXiv:0912.0537
Ferri, M., Gagliardi, C., Grasselli, L.: A graph-theoretical representation of pl-manifolds—a survey on crystallizations. Aequationes Math. 31(2-3), 121–141 (1986)
Ivanov, S.V.: The computational complexity of basic decision problems in 3-dimensional topology. Geom. Dedicata 131, 1–26 (2008), http://dx.doi.org/10.1007/s10711-007-9210-4
Keszegh, B., Pach, J., Pálvölgyi, D., Tóth, G.: Drawing cubic graphs with at most five slopes. Comput. Geom. 40(2), 138–147 (2008), http://dx.doi.org/10.1016/j.comgeo.2007.05.003
Richter, D.A.: Ghost symmetry and an analogue of Steinitz’s theorem. Contrib. Alg. Geom. ( to appear, 2010)
Richter-Gebert, J.: Realization Spaces of Polytopes. Lecture Notes in Mathematics, vol. 1643. Springer, Heidelberg (1996)
Richter-Gebert, J., Kortenkamp, U.H.: The interactive geometry software Cinderella. Springer-Verlag, Heidelberg (1999); with 1 CD-ROM (Windows, MacOS, UNIX and JAVA-1.1 platform)
Tutte, W.T.: Graph Theory, Encyclopedia of Mathematics and its Applications, vol. 21. Addison-Wesley Publishing Company, Menlo Park (1984)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Richter, D.A. (2011). How to Draw a Tait-Colorable Graph. In: Brandes, U., Cornelsen, S. (eds) Graph Drawing. GD 2010. Lecture Notes in Computer Science, vol 6502. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-18469-7_32
Download citation
DOI: https://doi.org/10.1007/978-3-642-18469-7_32
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-18468-0
Online ISBN: 978-3-642-18469-7
eBook Packages: Computer ScienceComputer Science (R0)