Hamiltonian cycles in 7-tough \((P_3 \cup 2P_1)\)-free graphs (Q2675828)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7592396
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Hamiltonian cycles in 7-tough \((P_3 \cup 2P_1)\)-free graphs |
scientific article; zbMATH DE number 7592396 |
Statements
Hamiltonian cycles in 7-tough \((P_3 \cup 2P_1)\)-free graphs (English)
0 references
26 September 2022
0 references
A \(t\)-tough graph is a noncomplete graph \(G\) such that \(|S| \geq t \cdot c(G-S)\) for every cutset \(S\) of \(G\). This concept is strongly related to the Hamiltonicity of graphs. In the paper under review, the authors prove that every \(7\)-tough \((P_3 \cup 2P_1)\)-free graph with at least three vertices is Hamiltonian.
0 references
Hamiltonian graphs
0 references
Chvatal toughness conjecture
0 references
toughness of a graph
0 references
0.9532425
0 references
0.93289876
0 references
0.9216735
0 references
0.9160907
0 references
0.91037714
0 references
0.9038006
0 references
0 references
0.8933729
0 references
0.8899136
0 references
