Abstract
Some results on longest circuits on graphs of cell decompositions of closed 2-surfaces are presented.
Similar content being viewed by others
References
A. Altshuler,Hamiltonian circuits in some maps on the torus, Discrete Math.1 (1972), 299–314.
G. Ewald,Hamiltonian circuits in simplicial complexes, Geometriae Dedicata2 (1973), 115–125.
G. Ewald,Cut numbers and long circuits in graphs of the family G (4,4) (to appear).
B. Grünbaum,Polytopes, graphs, and complexes, Bull. Amer. Math. Soc.76 (1970), 1131–1201.
B. Grünbaum and H. Walther,Shortness exponents of families of graphs, J. Combinatorial Theory (A)14 (1973), 364–385.
C. N. Reynolds,Circuits upon polyhedra, Ann. of Math.33 (1932), 367–372.
Author information
Authors and Affiliations
Additional information
This work has been supported by the National Research Council of Canada.
Rights 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
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF02761970