Every 3-connected \(\{K_{1,3},N_{3,3,3}\}\)-free graph is Hamiltonian (Q370939)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Every 3-connected \(\{K_{1,3},N_{3,3,3}\}\)-free graph is Hamiltonian |
scientific article |
Statements
Every 3-connected \(\{K_{1,3},N_{3,3,3}\}\)-free graph is Hamiltonian (English)
0 references
20 September 2013
0 references
Hamiltonian graphs
0 references
forbidden subgraphs
0 references
claw-free graphs
0 references
closure
0 references
