Every 3-connected \(\{K_{1,3},N_{1,2,3}\}\)-free graph is Hamilton-connected (Q292269)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6592586
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Every 3-connected \(\{K_{1,3},N_{1,2,3}\}\)-free graph is Hamilton-connected |
scientific article; zbMATH DE number 6592586 |
Statements
Every 3-connected \(\{K_{1,3},N_{1,2,3}\}\)-free graph is Hamilton-connected (English)
0 references
13 June 2016
0 references
Hamilton-connected
0 references
forbidden subgraphs
0 references
claw-free graphs
0 references
crucial edges
0 references
0.9370073676109314
0 references
0.9088060259819032
0 references
0.9052273631095886
0 references
0.8912639021873474
0 references
0.8860222697257996
0 references
