Precise lower bound for the number of edges of minor weight in planar maps
Mathematica Slovaca (1992)
- Volume: 42, Issue: 2, page 129-142
- ISSN: 0139-9918
Access Full Article
topHow to cite
topReferences
top- BORODIN O. V., On the total coloring of planar graphs., J. Reine Angew. Math. 394 (1989), 180-185. (1989) Zbl0653.05029MR0977440
- JUCOVIČ E., Strengthening of a theorem about 3 -polytopes, Geom. Dedicata 13 (1974), 233-237. (1974) Zbl0297.52006MR0348629
- KOTZIG A., Contribution to the theory of Eulerian polyhedra, (Slovak), Mat.-Fyz. Čas. (Math. Slovaca) 5 (1955), 101-113. (1955) MR0074837
- STEINITZ K., Polyeder und Raumcinteilungen, Encyklop. d. math. Wissensch. 3 (1922), 1-139. (1922)
- Teoria Combinatoria, Proc. Intern. Colloq. Rome 1973, Accademia nacionále dei lincei, Roma, 1976. (1973)
Citations in EuDML Documents
top- Igor Fabrici, Stanislav Jendrol', An inequality concerning edges of minor weight in convex 3-polytopes
- Stanislav Jendroľ, Paths with restricted degrees of their vertices in planar graphs
- Mirko Horňák, Stanislav Jendrol, Unavoidable set of face types for planar maps
- Dávid Hudák, Peter Šugerek, Light edges in 1-planar graphs with prescribed minimum degree