In the mathematical discipline of graph theory, the medial graph of plane graph G is another graph M(G) that represents the adjacencies between edges in the faces of G. Medial graphs were introduced in 1922 by Ernst Steinitz to study combinatorial properties of convex polyhedra,[1] although the inverse construction was already used by Peter Tait in 1877 in his foundational study of knots and links.[2][3]
- ^ Steinitz, Ernst (1922), "Polyeder und Raumeinteilungen", Encyclopädie der mathematischen Wissenschaften, Band 3 (Geometries), pp. 1–139
- ^ Tait, Peter G. (1876–1877). "On Knots I". Transactions of the Royal Society of Edinburgh. 28: 145–190. doi:10.1017/S0080456800090633. S2CID 171186257.
Revised May 11, 1877.
- ^ Tait, Peter G. (1876–1877). "On Links (Abstract)". Proceedings of the Royal Society of Edinburgh. 9 (98): 321–332. doi:10.1017/S0370164600032363.
© MMXXIII Rich X Search. We shall prevail. All rights reserved. Rich X Search