Covering 3‐uniform hypergraphs by vertex‐disjoint tight paths (Q6046654): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W4283207141 / rank | |||
Normal rank | |||
Revision as of 10:57, 30 July 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
