Edge colorings of embedded graphs (Q1576578)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Edge colorings of embedded graphs
scientific article

    Statements

    Edge colorings of embedded graphs (English)
    0 references
    0 references
    0 references
    21 May 2001
    0 references
    The authors give some conditions for a graph to be embeddable in a surface with Eulerian negative characteristic and to have as chromatic index the maximum degree of its vertices.
    0 references
    graph
    0 references
    surface
    0 references
    embedding
    0 references
    edge coloring
    0 references
    chromatic index
    0 references
    0 references

    Identifiers