Every 3-connected \(\{K_{1,3},N_{1,2,3}\}\)-free graph is Hamilton-connected (Q292269): 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-015-1598-2 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W785039738 / rank | |||
Normal rank | |||
Latest revision as of 20:20, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Every 3-connected \(\{K_{1,3},N_{1,2,3}\}\)-free graph is Hamilton-connected |
scientific article |
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
