Minimum degree ensuring that a hypergraph is Hamiltonian-connected (Q6080369)
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: Minimum degree ensuring that a hypergraph is Hamiltonian-connected |
scientific article; zbMATH DE number 7745022
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Minimum degree ensuring that a hypergraph is Hamiltonian-connected |
scientific article; zbMATH DE number 7745022 |
Statements
Minimum degree ensuring that a hypergraph is Hamiltonian-connected (English)
0 references
2 October 2023
0 references
Hamiltonian Berge path
0 references
Hamiltonian-connected graph
0 references
Hamiltonian Berge cycle
0 references
