Minimal weight of face in plane triangulations without 4-vertices
Article
Received:
- 39 Downloads
Keywords
Minimal Weight Plane Triangulation
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.
Preview
Unable to display preview. Download preview PDF.
Literature cited
- 1.H. Lebesgue, “Quelques consequences simple de la formule d'Euler,” J. Math. Pures Appl.,19, 27–43 (1940).Google Scholar
- 2.A. Kotzig, “From the theory of Euler's polyhedrons,” Mat. Casopis Sloven.,13, 20–34 (1963).Google Scholar
- 3.M. D. Plummer, “On the cyclic connectivity of planar graphs,” in: Graph Theory and Applications, Berlin (1972), pp. 235–242.Google Scholar
- 4.B. Grunbaum, “Polytopal graphs,” Math. Assoc. of America Studies in Math.,12, 201–224 (1975).Google Scholar
- 5.A. Kotzig, “Extremal polyhedral graphs,” in: Proc. Sec. Int. Conf. Combin. Math., New York (1978), pp. 569–570.Google Scholar
- 6.O. V. Borodin, “Solution of Kotzig's and Grunbaum's problems on the separability of a cycle in planar graphs,” Matem. Zam.,46, No. 5, 9–12 (1989).Google Scholar
- 7.O. V. Borodin, “New structural properties of planar graphs with applications in coloring,” in: 33rd Int. Wiss. Koll. TH Ilmenau, Ilmenau (1988), pp. 159–162.Google Scholar
Copyright information
© Plenum Publishing Corporation 1992