3-connected \(\{K_{1,3},P_9\}\)-free graphs are Hamiltonian-connected (Q742625)
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 6346036
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | 3-connected \(\{K_{1,3},P_9\}\)-free graphs are Hamiltonian-connected |
scientific article; zbMATH DE number 6346036 |
Statements
3-connected \(\{K_{1,3},P_9\}\)-free graphs are Hamiltonian-connected (English)
0 references
19 September 2014
0 references
Hamilton-connected
0 references
3-connected
0 references
claw-free
0 references
dominating
0 references
closure
0 references
0.9382534
0 references
0.93427664
0 references
0 references
0.8888589
0 references
0.88823605
0 references
0.8806242
0 references
0.87696517
0 references
