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

From MaRDI portal
scientific article
Language Label Description Also known as
English
Complexity of approximation of 3-edge-coloring of graphs
scientific article

    Statements

    Complexity of approximation of 3-edge-coloring of graphs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    9 June 2010
    0 references
    edge-coloring of graphs
    0 references
    NP-completeness
    0 references
    approximation algorithms
    0 references
    cyclical edge-connectivity
    0 references

    Identifiers