Abstract
This paper provides a polyhedral theory on graphs from which the criteria of Whitney and MacLane for the planarity of graphs are unified, and a brief proof of the Gauss crossing conjecture is obtained.
Similar content being viewed by others
References
Gauss, C.F.,Werke, Teubner, Leipzig 1900, pp. 272, 282–286.
Dehn, M.,Uber kombinatorische topologie, Acta Math.,67 (1936), 123–168.
Treybig, L.B.,A characterization of the double point structure of the projection of a polygonal knot in regular position, Trans. Amer. Math. Soc.,130 (1968), 223–247.
Rosenstiehl, P. and Read, R. C.,On the principal edge tripartition of a graph, Ann. Discrete Math.,3 (1978), 195–226.
Grunbaum, B.,Arrangement and spreads, Reg. Conf. Ser. in Math., Amer. Math. Soc., (10) 1972.
Liu, Y.,Modulo-2 programming and planar embeddings (in Chinese), Acta Math. Appl. Sinica,1 (1978), 395–406.
Liu, Y.,On the linearity of testing planarity of a graph, Chinese Ann. Math.,7B (1986), 425–434.
Liu, Y., Embeddability in Graphs VI, Research Report No. 8, Institute of Applied Math., 1991.
MacLane, S.,A structural characterization of planar combinatorial graphs, Duke Math. J.,3 (1937), 460–472.
Whitney, H.,Nonseparable and planar graphs, Trans. Amer. Math. Soc.,34 (1932), 339–362.
Author information
Authors and Affiliations
Additional information
Supported by the National Natural Science Foundation of China.
Rights and permissions
About this article
Cite this article
Yanpei, L. A polyhedral theory on graphs. Acta Mathematica Sinica 10, 136–142 (1994). https://doi.org/10.1007/BF02580420
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF02580420