Hamilton cycles in line graphs of 3-hypergraphs (Q2144607)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Hamilton cycles in line graphs of 3-hypergraphs |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Hamilton cycles in line graphs of 3-hypergraphs |
scientific article |
Statements
Hamilton cycles in line graphs of 3-hypergraphs (English)
0 references
14 June 2022
0 references
The authors prove that a 52-connected line graph of a rank 3 hypergraph is Hamiltonian.
0 references
Hamilton cycle
0 references
line graph
0 references
3-hypergraph
0 references
0.8416638374328613
0 references
0.8202261924743652
0 references
0.8152419924736023
0 references
0.8110260963439941
0 references
