Every 3-connected \(\{ K_{1 , 3} , Z_7 \}\)-free graph of order at least 21 is Hamilton-connected (Q2022131)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Every 3-connected \(\{ K_{1 , 3} , Z_7 \}\)-free graph of order at least 21 is Hamilton-connected |
scientific article |
Statements
Every 3-connected \(\{ K_{1 , 3} , Z_7 \}\)-free graph of order at least 21 is Hamilton-connected (English)
0 references
28 April 2021
0 references
Let \(Z_i\) be the graph obtained by attaching an endvertex of a path of length \(i\) to a vertex of a triangle for a positive integer \(i\). The authors prove that every 3-connected \(K_{1,3}\), \(Z_7\)-free graph is Hamilton-connected, with one exceptional graph.
0 references
Hamilton-connected
0 references
closure
0 references
forbidden subgraph
0 references
claw-free
0 references
\(Z_i\)-free
0 references
0 references
0 references
