Skip to main content
Log in

On shortness exponents of families of graphs

  • Published:
Israel Journal of Mathematics Aims and scope Submit manuscript

Abstract

Some results on longest circuits on graphs of cell decompositions of closed 2-surfaces are presented.

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. A. Altshuler,Hamiltonian circuits in some maps on the torus, Discrete Math.1 (1972), 299–314.

    Article  MATH  MathSciNet  Google Scholar 

  2. G. Ewald,Hamiltonian circuits in simplicial complexes, Geometriae Dedicata2 (1973), 115–125.

    Article  MATH  MathSciNet  Google Scholar 

  3. G. Ewald,Cut numbers and long circuits in graphs of the family G (4,4) (to appear).

  4. B. Grünbaum,Polytopes, graphs, and complexes, Bull. Amer. Math. Soc.76 (1970), 1131–1201.

    Article  MATH  MathSciNet  Google Scholar 

  5. B. Grünbaum and H. Walther,Shortness exponents of families of graphs, J. Combinatorial Theory (A)14 (1973), 364–385.

    Article  MATH  Google Scholar 

  6. C. N. Reynolds,Circuits upon polyhedra, Ann. of Math.33 (1932), 367–372.

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Additional information

This work has been supported by the National Research Council of Canada.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Ewald, G. On shortness exponents of families of graphs. Israel J. Math. 16, 53–61 (1973). https://doi.org/10.1007/BF02761970

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02761970

Keywords

Navigation