Three ways to cover a graph (Q898135)

From MaRDI portal
Revision as of 07:40, 10 December 2024 by Import241208061232 (talk | contribs) (Normalize DOI.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Three ways to cover a graph
scientific article

    Statements

    title
    Three ways to cover a graph (English)
    0 references
    author
    Kolja Knauer
    0 references
    Torsten Ueckerdt
    0 references
    publication date
    8 December 2015
    0 references
    zbMATH Keywords
    graph covering
    0 references
    interval number
    0 references
    track number
    0 references
    linear arboricity
    0 references
    caterpillar arboricity
    0 references
    star arboricity
    0 references
    cites work
    Q3907606
    0 references
    Star arboricity
    0 references
    Q3503433
    0 references
    Q5510192
    0 references
    Q5580172
    0 references
    Q4862889
    0 references
    Q5445048
    0 references
    Q4170745
    0 references
    Q3838186
    0 references
    Q5670652
    0 references
    Q3220605
    0 references
    Q4949848
    0 references
    Q5539649
    0 references
    Q3684139
    0 references
    Q4869540
    0 references
    Q4248536
    0 references

    Identifiers

    zbMATH DE Number
    6517680
    0 references
    OpenAlex ID
    W2139849594
    0 references
    arXiv ID
    1205.1627
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q898135&oldid=38527864"
    Powered by MediaWiki