Edge coloring of graphs embedded in a surface of nonnegative characteristic (Q2401779)

From MaRDI portal
Revision as of 08:15, 14 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Edge coloring of graphs embedded in a surface of nonnegative characteristic
scientific article

    Statements

    Edge coloring of graphs embedded in a surface of nonnegative characteristic (English)
    0 references
    5 September 2017
    0 references
    Let \(G\) be a graph embeddable in a surface of nonnegative characteristic with maximum degree six. Let \(k \geq 3\) be an integer. A vertex \(v\) of a graph \(G\) is called a \(k\)-monster if \(v\) is contained in all cycles of length from 3 to \(k\). The following theorem is proved. If \(G\) is a graph of nonnegative characteristic with \(\Delta = 6\) and without 6-monster, then \(\chi^{\prime}(G) = 6\).
    0 references
    embedded graph
    0 references
    chromatic index
    0 references
    cycle
    0 references
    class 1
    0 references
    0 references

    Identifiers