Covering 3‐uniform hypergraphs by vertex‐disjoint tight paths (Q6046654)

From MaRDI portal
Revision as of 17:58, 30 December 2024 by Import241228121245 (talk | contribs) (Normalize DOI.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
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

    title
    Covering 3‐uniform hypergraphs by vertex‐disjoint tight paths (English)
    0 references
    publication date
    5 October 2023
    0 references
    zbMATH Keywords
    Hamilton cycle
    0 references
    tight path
    0 references
    cites work
    Q4519896
    0 references
    Q3078214
    0 references

    Identifiers

    arXiv ID
    2003.11686
    0 references
    Mathematics Subject Classification ID
    05C45
    0 references
    05C38
    0 references
    05C65
    0 references
    zbMATH DE Number
    7746551
    0 references
    OpenAlex ID
    W4283207141
    0 references
    DOI
    10.1002/JGT.22853
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q6046654&oldid=39669297"
    Powered by MediaWiki