A necessary condition for the square of a graph to be Hamiltonian
type: Item
instance of: scholarly article
title: A necessary condition for the square of a graph to be Hamiltonian
zbMATH Open document ID: 0315.05120
DOI: 10.1016/0095-8956(75)90078-7
author: Herbert Fleischner
author: Arthur M. Hobbs
published in: Journal of Combinatorial Theory. Series B
publication date: 1975-01-01T00:00:00Z
Mathematics Subject Classification ID: 05C35
Mathematics Subject Classification ID: 05C99
zbMATH DE Number: 3492721
MaRDI profile type: Publication
full work available at URL: 0095-8956(75)90078-7
OpenAlex ID: W2062601399
cites work: On spanning subgraphs of a connected bridgeless graph and their application to DT-graphs
cites work: The square of every two-connected graph is Hamiltonian
cites work: Q5572939
cites work: Trees with Hamiltonian square
cites work: On a certain ordering of the vertices of a tree
cites work: Hamiltonian Total Graphs
cites work: The square of a block is vertex pancyclic
description: scientific article; zbMATH DE number 3492721