Minimum degree ensuring that a hypergraph is Hamiltonian-connected (Q6080369): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1016/j.ejc.2023.103782 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.EJC.2023.103782 / rank | |||
Normal rank | |||
Latest revision as of 18:15, 30 December 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
