Skip to main content
Log in

Light paths with an odd number of vertices in polyhedral maps

  • Published:
Czechoslovak Mathematical Journal Aims and scope Submit manuscript

Abstract

Let P k be a path on k vertices. In an earlier paper we have proved that each polyhedral map G on any compact 2-manifold \(M\) with Euler characteristic \(x\left( M \right) \leqslant {\text{0}}\) contains a path P k such that each vertex of this path has, in G, degree \(\leqslant k\left[ {\frac{{5 + \sqrt {49 - 24 \times \left( M \right)} }}{2}} \right]\). Moreover, this bound is attained for k = 1 or k ≥ 2, k even. In this paper we prove that for each odd \(k \geqslant \frac{{\text{4}}}{{\text{3}}}\left[ {\frac{{5 + \sqrt {49 - 24 \times \left( M \right)} }}{2}} \right] + 1\), this bound is the best possible on infinitely many compact 2-manifolds, but on infinitely many other compact 2-manifolds the upper bound can be lowered to \(\left[ {\left( {k - \frac{{\text{1}}}{{\text{3}}}} \right)\frac{{5 + \sqrt {49 - 24 \times \left( M \right)} }}{2}} \right]\).

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. I. Fabrici, S. Jendrol': Subgraphs with restricted degrees of their vertices in planar 3-connected graphs. Graphs Combin. 13 (1997), 245–250.

    Google Scholar 

  2. B. Grünbaum, G. C. Shephard: Analogues for tiling of Kotzig's theorem on minimal weights of edges. Ann. Discrete Math. 12 (1982), 129–140.

    Google Scholar 

  3. J. Ivančo: The weight of a graph. Ann. Discrete Math. 51 (1992), 113–116.

    Google Scholar 

  4. S. Jendrol': Paths with restricted degrees of their vertices in planar graphs. Czechoslovak Math. J. 49(124) (1999), 481–490.

    Google Scholar 

  5. S. Jendrol', H.-J. Voss: A local property of polyhedral maps on compact 2-dimensional manifolds. Discrete Math. 212 (2000), 111–120.

    Google Scholar 

  6. S. Jendrol', H.-J. Voss: Light paths with an odd number of vertices in large polyhedral maps. Ann. Comb. 2 (1998), 313–324.

    Google Scholar 

  7. M. Jungerman: Ph. D. Thesis. Univ. of California. Santa Cruz, California 1974.

  8. A. Kotzig: Contribution to the theory of Eulerian polyhedra. Math. Čas. SAV (Math. Slovaca) 5 (1955), 111–113.

    Google Scholar 

  9. A. Kotzig: Extremal polyhedral graphs. Ann. New York Acad. Sci. 319 (1979), 569–570.

    Google Scholar 

  10. G. Ringel: Map Color Theorem. Springer-Verlag Berlin (1974).

    Google Scholar 

  11. J. Zaks: Extending Kotzig's theorem. Israel J. Math. 45 (1983), 281–296.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Jendroľ, S., Voss, H.J. Light paths with an odd number of vertices in polyhedral maps. Czechoslovak Mathematical Journal 50, 555–564 (2000). https://doi.org/10.1023/A:1022837727747

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1022837727747

Navigation