Every 3-connected \(\{K_{1, 3}, \Gamma_3\}\)-free graph is Hamilton-connected (Q6646424)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Every 3-connected \(\{K_{1, 3}, \Gamma_3\}\)-free graph is Hamilton-connected |
scientific article; zbMATH DE number 7952111
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Every 3-connected \(\{K_{1, 3}, \Gamma_3\}\)-free graph is Hamilton-connected |
scientific article; zbMATH DE number 7952111 |
Statements
Every 3-connected \(\{K_{1, 3}, \Gamma_3\}\)-free graph is Hamilton-connected (English)
0 references
2 December 2024
0 references
Hamilton-connected
0 references
closure
0 references
forbidden subgraph
0 references
claw-free
0 references
\(\Gamma_3\)-free
0 references
0 references
0 references
