A sufficient condition for all short cycles
type: Item
instance of: scholarly article
title: A sufficient condition for all short cycles
zbMATH Open document ID: 0882.05081
DOI: 10.1016/S0166-218X(97)00032-2
author: Stephan Brandt
published in: Discrete Applied Mathematics
publication date: 1997-11-18T00:00:00Z
full work available at URL: dam
Mathematics Subject Classification ID: 05C38
zbMATH DE Number: 1088853
zbMATH Keywords: pancyclic graphs
zbMATH Keywords: Hamiltonian graph
zbMATH Keywords: bipartite graph
zbMATH Keywords: circumference
zbMATH Keywords: short cycles
zbMATH Keywords: longest cycle
MaRDI profile type: Publication
cites work: Pancyclic graphs. I
cites work: Large cycles in graphs
cites work: Some Theorems on Abstract Graphs
cites work: Q3944634
cites work: On Hamiltonian bipartite graphs
OpenAlex ID: W2012008904
Recommended article: Q3538373
Recommended article: A sufficient condition for dominating cycles
Recommended article: Q4206768
Recommended article: Q5758495
Recommended article: A sufficient condition for cyclability in directed graphs
Recommended article: A note about shortest cycle covers
Recommended article: Q4855971
Recommended article: A sufficient condition involving implicit degree and neighborhood intersection for long cycles
Recommended article: On short cycles through prescribed vertices of a graph
Recommended article: Short Cycles via Low-Diameter Decompositions
description: scientific article; zbMATH DE number 1088853