Monatshefte für Mathematik

, Volume 82, Issue 2, pp 125–149 | Cite as

In the square of graphs, hamiltonicity and pancyclicity, Hamiltonian connectedness and panconnectedness are equivalent concepts

  • H. Fleischner


The squareG2 of a graphG has the same point set asG, and two points ofG2 are adjacent inG2 if and only if their distance inG is at most two. The result thatG2 is Hamiltonian ifG is two-connected, has been established early in 1971. A conjecture (ofA. Bondy) followed immediately: SupposeG2 to have a Hamiltonian cycle; is it true that for anyvV(G), there exist cyclesC j containingv and having arbitrary lengthj, 3≤j≤|V(G)|. The proof of this conjecture is one of the two main results of this paper. The other main result states that ifG2 contains a Hamiltonian pathP(v, w) joining the pointsv andw, thenG2 contains for anyj withd G 2(v, w)j≤≤|V(G)|−1 a pathP j (v, w) of lengthj joiningv andw. By this, a conjecture ofF. J. Faudree andR. H. Schelp is proved and generalized for the square of graphs.

However, to prove these two results extensive preliminary work is necessary in order to make the proof of the main results transparent (Theorem 1 through 5); and Theorem 3 plays a central role for the main results. As can be seen from the statement of Theorem 3, the following known results follow in a stronger form: (a) IfG is two-connected, thenG2 is Hamiltonian-connected; (b) IfG is two-connected, thenG2 is 1-Hamiltonian.


Result State Preliminary Work Hamiltonian Cycle Strong Form Equivalent Concept 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    Dirac, G. A.: Minimally two-connected graphs. J. Reine u. Angew. Math.228, 204–216 (1967).Google Scholar
  2. [2]
    Faudree, F. J., andR. H. Schelp: The square of a block is strongly path connected. J. Comb. Theory, Ser. B20, 47–61 (1976).Google Scholar
  3. [3]
    Fleischner, H.: On spanning subgraphs of a connected bridgeless graph and their application to DT-Graphs. J. Comb. Theory, Ser. B16, 17–28 (1974).Google Scholar
  4. [4]
    Fleischner, H.: The square of every two-connected graph is Hamiltonian. J. Comb. Theory, Ser. B16, 29–34 (1974).Google Scholar
  5. [5]
    Fleischner, H., andA. M. Hobbs: A necessary condition for the square of a graph to be Hamiltonian. J. Comb. Theory, Ser. B19, 97–118 (1975).Google Scholar
  6. [6]
    Fleischner, H., andA. M. Hobbs: Hamiltonian total graphs. Math. Nachr.68, 59–82 (1975).Google Scholar
  7. [7]
    Fleischner, H., undH. V. Kronk: Hamiltonsche Linien im Quadrat brückenloser Graphen mit Artikulationen. Mh. Math.76, 112–117 (1972).Google Scholar
  8. [8]
    Harary, F.: Graph Theory. Reading, Mass.: Addison Wesley. 1969.Google Scholar
  9. [9]
    Hobbs, A. M.: The square of a block is vertex pancyclic. J. Comb. Theory, Ser. B20, 1–4 (1976).Google Scholar

Copyright information

© Springer-Verlag 1976

Authors and Affiliations

  • H. Fleischner
    • 1
  1. 1.Institut für InformationsverarbeitungWienAustria

Personalised recommendations