3-connected \(\{K_{1,3},P_9\}\)-free graphs are Hamiltonian-connected (Q742625): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s00373-013-1344-6 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2004434341 / rank | |||
Normal rank | |||
Revision as of 02:20, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | 3-connected \(\{K_{1,3},P_9\}\)-free graphs are Hamiltonian-connected |
scientific article |
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
