Classifying \(k\)-edge colouring for \(H\)-free graphs (Q1739218)

From MaRDI portal
Revision as of 07:08, 11 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
Classifying \(k\)-edge colouring for \(H\)-free graphs
scientific article

    Statements

    title
    Classifying \(k\)-edge colouring for \(H\)-free graphs (English)
    0 references
    author
    Esther Galby
    0 references
    Paloma T. Lima
    0 references
    Daniël Paulusma
    0 references
    Bernard Ries
    0 references
    publication date
    26 April 2019
    0 references
    zbMATH Keywords
    edge-colouring
    0 references
    \(H\)-free graph
    0 references
    computational complexity
    0 references
    cites work
    Q4697576
    0 references
    Q2804810
    0 references
    Q4193514
    0 references
    Words and graphs
    0 references
    Q4448764
    0 references

    Identifiers

    zbMATH DE Number
    7047946
    0 references
    OpenAlex ID
    W2963501418
    0 references
    arXiv ID
    1810.04379
    0 references
    Wikidata QID
    Q128333959
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1739218&oldid=38722361"
    Powered by MediaWiki