Author:
Heise Carl Georg,Panagiotou Konstantinos,Pikhurko Oleg,Taraz Anusch
Publisher
Springer Science and Business Media LLC
Subject
Computational Theory and Mathematics,Discrete Mathematics and Combinatorics,Geometry and Topology,Theoretical Computer Science
Reference32 articles.
1. Appel, K., Haken, W.: Every planar map is four colorable. Part I: discharging. Ill. J. Math. 213, 429–490 (1977)
2. Appel, K., Haken, W., Koch, J.: Every planar map is four colorable. Part II: reducibility. Ill. J. Math. 213, 491–567 (1977)
3. Bokowski, J., Guedes de Oliveira, A.: On the generation of oriented matroids. Discrete Comput. Geom. 24, 197–208 (2000)
4. Brehm, U.: A nonpolyhedral triangulated Möbius strip. Proc. Am. Math. Soc. 89(3), 519–522 (1983)
5. Bryant, J.L.: Approximating embeddings of polyhedra in codimension three. Trans. Am. Math. Soc. 170, 85–95 (1972)
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Transversals and Colorings of Simplicial Spheres;Discrete & Computational Geometry;2023-07-05
2. Chromatic Numbers of Simplicial Manifolds;Beiträge zur Algebra und Geometrie / Contributions to Algebra and Geometry;2019-11-18
3. Properties of chromatic polynomials of hypergraphs not held for chromatic polynomials of graphs;European Journal of Combinatorics;2017-08
4. On three measures of non-convexity;Israel Journal of Mathematics;2017-03