On the edge connectivity, Hamiltonicity, and toughness of vertex-transitive graphs
type: Item
instance of: scholarly article
title: On the edge connectivity, Hamiltonicity, and toughness of vertex-transitive graphs
zbMATH Open document ID: 1024.05054
author: Jan van den Heuvel
author: Bill Jackson
published in: Journal of Combinatorial Theory. Series B
publication date: 2000-06-25T00:00:00Z
Mathematics Subject Classification ID: 05C40
Mathematics Subject Classification ID: 05C45
Mathematics Subject Classification ID: 05C25
zbMATH DE Number: 1464279
zbMATH Keywords: vertex-transitive
zbMATH Keywords: edge connectivity
zbMATH Keywords: Hamiltonicity
zbMATH Keywords: toughness
MaRDI profile type: Publication
full work available at URL: jctb.1999.1917
OpenAlex ID: W2080868743
cites work: Q4309106
cites work: Proof of a conjecture of Haeggkvist on cycles and independent edges
cites work: Q3866156
cites work: Q5422499
cites work: Tough graphs and Hamiltonian circuits.
cites work: Q3912829
cites work: Flows and generalized coloring theorems in graphs
cites work: Bounds of the number of disjoint spanning trees
cites work: Über den Zusammenhang symmetrischer Graphen
cites work: Minimale \(n\)-fach kantenzusammenhängende Graphen
cites work: Q3204495
cites work: Connectivity of transitive graphs
DOI: 10.1006/JCTB.1999.1917
description: scientific article; zbMATH DE number 1464279