Every 3-connected essentially 10-connected line graph is Hamilton-connected (Q1759410)
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 6108960
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Every 3-connected essentially 10-connected line graph is Hamilton-connected |
scientific article; zbMATH DE number 6108960 |
Statements
Every 3-connected essentially 10-connected line graph is Hamilton-connected (English)
0 references
20 November 2012
0 references
super-Eulerian graph
0 references
Hamiltonian line graph
0 references
edge-disjoint spanning tree
0 references
0.9407659769058228
0 references
0.9362131357192992
0 references
0.9124091863632202
0 references
0.8979581594467163
0 references
0.8736331462860107
0 references
