Toughness and Hamiltonicity in \(k\)-trees (Q868350): Difference between revisions
From MaRDI portal
Latest revision as of 15:24, 25 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Toughness and Hamiltonicity in \(k\)-trees |
scientific article |
Statements
Toughness and Hamiltonicity in \(k\)-trees (English)
0 references
2 March 2007
0 references
The number of components of a simple, undirected graph \(G\) is denoted by \(\omega(G)\); \(G\) is \(t\)-tough if, for every subset \(S\) of \(V(G)\), \(\omega(G-S)>1\Rightarrow| S| \geq t\omega(G-S)\); the toughness \(\tau(G)\) is \(\max\{t:G\text{ is }t\)-tough
0 references
\(t\)-tough graph
0 references
Hamiltonian graph
0 references
traceable graph
0 references
chordal graph
0 references
complexity
0 references
