Minimum degree ensuring that a hypergraph is Hamiltonian-connected (Q6080369): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 06:00, 10 July 2024
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
