In the square of graphs, Hamiltonicity and pancyclicity, Hamiltonian connectedness and panconnectedness are equivalent concepts
type: Item
instance of: scholarly article
title: In the square of graphs, Hamiltonicity and pancyclicity, Hamiltonian connectedness and panconnectedness are equivalent concepts
zbMATH Open document ID: 0353.05043
DOI: 10.1007/BF01305995
author: Herbert Fleischner
published in: Monatshefte für Mathematik
publication date: 1976-01-01T00:00:00Z
full work available at URL: https://eudml.org/doc/177773
Mathematics Subject Classification ID: 05C35
zbMATH DE Number: 3549025
MaRDI profile type: Publication
cites work: Minimally 2-connected graphs.
cites work: A necessary condition for the square of a graph to be Hamiltonian
cites work: Hamiltonian Total Graphs
cites work: Hamiltonsche Linien im Quadrat brückenloser Graphen mit Artikulationen
cites work: Q5572939
cites work: The square of a block is vertex pancyclic
OpenAlex ID: W1989780696
description: scientific article; zbMATH DE number 3549025