A sufficient condition for planar graphs with maximum degree 6 to be totally 8-colorable (Q2030446)

From MaRDI portal
scientific article
Language Label Description Also known as
English
A sufficient condition for planar graphs with maximum degree 6 to be totally 8-colorable
scientific article

    Statements

    A sufficient condition for planar graphs with maximum degree 6 to be totally 8-colorable (English)
    0 references
    0 references
    0 references
    7 June 2021
    0 references
    planar graph
    0 references
    total coloring
    0 references
    4-fan
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references