Every 3-connected \(\{K_{1,3},N_{3,3,3}\}\)-free graph is Hamiltonian (Q370939)
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},N_{3,3,3}\}\)-free graph is Hamiltonian |
scientific article; zbMATH DE number 6209875
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Every 3-connected \(\{K_{1,3},N_{3,3,3}\}\)-free graph is Hamiltonian |
scientific article; zbMATH DE number 6209875 |
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
0 references
0.9382534
0 references
0.91693056
0 references
0.9087512
0 references
0.90540063
0 references
0 references
