Skip to main content
SpringerLink
Log in

Graphen, in welchen je zwei Eckpunkte von einem längsten Weg vermieden werden

  • Published:
Annali dell’Università di Ferrara Aims and scope Submit manuscript

Riassunto

In questa nota costruiamo dei grafi, nei quali per ogni coppia di punti esiste un cammino lunghissimo che non contiene questi punti. Questi esempi sono più piccoli di quelli noti sino ad ora; consideriamo separatamente i casi dei grafi non planari 1-connessi, planari 1-connessi e planari 2-connessi.

Summary

In this paper we construct graphs in which for each two vertices there is a longest path avoiding both of them. These examples are smaller than those previously known; we treat separately the cases of nonplanar 1-connected, planar 1-connected and planar 2-connected graphs.

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

Access this article

Log in via an institution

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

Instant access to the full article PDF.

Institutional subscriptions

Literatur

  1. P. Erdös—G. Katona (Herausgeber),Theory of Graphs, Proc. Colloq. Tihany, 1966, Academic Press, New York, 1968.

    MATH  Google Scholar 

  2. B. Grünbaum,Vertices Missed by Longest Paths or Circuits, J. Comb. Theory,17 (1974), pp. 31–38.

    Article  MATH  Google Scholar 

  3. B. Grünbaum,Polytopal Graphs (erscheint inStudies in Graph Theory, Veröffentlichung der Math. Assoc. of America).

  4. J. D. Horton,A hypotraceable graph (escheint demnächst).

  5. W. Schmitz,Über längste Wege und Kreise in Graphen (erscheint demnächst).

  6. C. Thomassen,Planar and infinite hypohamiltonian and hypotraceable graphs, Research Report Corr. 75-7, University of Waterloo.

  7. T. Zamfirescu,A Two-connected Planar Graph without Concurrent Longest Paths, J. Comb. Theory,13 (1972), pp. 116–121.

    MATH  MathSciNet  Google Scholar 

  8. T. Zamfirescu,On longest paths and circuits in graphs (erscheint in der Math. Scand.).

Download references

Author information

Authors and Affiliations

  1. Abteilung Mathematik, Universität Dortmund, 46, Dortmund, Bundersrepublik Deutschland

    Tudor Zamfirescu

Authors
  1. Tudor Zamfirescu
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Zamfirescu, T. Graphen, in welchen je zwei Eckpunkte von einem längsten Weg vermieden werden. Ann. Univ. Ferrara 21, 17–24 (1975). https://doi.org/10.1007/BF02826777

Download citation

  • Received:

  • Issue Date:

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

Search

Navigation