Complexity of approximation of 3-edge-coloring of graphs (Q975462)

From MaRDI portal
Revision as of 10:52, 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
Complexity of approximation of 3-edge-coloring of graphs
scientific article

    Statements

    title
    Complexity of approximation of 3-edge-coloring of graphs (English)
    0 references
    author
    Martin Kochol
    0 references
    Nad'a Krivoňáková
    0 references
    Silvia Smejová
    0 references
    Katarína Šranková
    0 references
    publication date
    9 June 2010
    0 references
    zbMATH Keywords
    edge-coloring of graphs
    0 references
    NP-completeness
    0 references
    approximation algorithms
    0 references
    cyclical edge-connectivity
    0 references

    Identifiers

    zbMATH DE Number
    5719189
    0 references
    OpenAlex ID
    W2004299695
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q975462&oldid=38561246"
    Powered by MediaWiki