On the edge connectivity, Hamiltonicity, and toughness of vertex-transitive graphs

DOI10.1006/jctb.1999.1917zbMath1024.05054OpenAlexW2080868743MaRDI QIDQ1569047

Bill Jackson, Jan van den Heuvel

Publication date: 25 June 2000

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jctb.1999.1917

zbMATH Keywords

Hamiltonicitytoughnessvertex-transitiveedge connectivity

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Connectivity (05C40) Eulerian and Hamiltonian graphs (05C45)

Related Items (3)

Vertex-transitive graphs that remain connected after failure of a vertex and its neighbors ⋮ 4-factor-criticality of vertex-transitive graphs ⋮ Small separations in vertex-transitive graphs

Cites Work

• Proof of a conjecture of Haeggkvist on cycles and independent edges
• Flows and generalized coloring theorems in graphs
• Bounds of the number of disjoint spanning trees
• Minimale \(n\)-fach kantenzusammenhängende Graphen
• Über den Zusammenhang symmetrischer Graphen
• Tough graphs and Hamiltonian circuits.
• Connectivity of transitive graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On the edge connectivity, Hamiltonicity, and toughness of vertex-transitive graphs