Covering 3‐uniform hypergraphs by vertex‐disjoint tight paths (Q6046654): Difference between revisions
From MaRDI portal
Revision as of 02:06, 3 August 2024
scientific article; zbMATH DE number 7746551
Language | Label | Description | Also known as |
---|---|---|---|
English | Covering 3‐uniform hypergraphs by vertex‐disjoint tight paths |
scientific article; zbMATH DE number 7746551 |
Statements
Covering 3‐uniform hypergraphs by vertex‐disjoint tight paths (English)
0 references
5 October 2023
0 references
Hamilton cycle
0 references
tight path
0 references
0 references