Three-colourability of planar graphs with no 5- or triangular \(\{3,6\}\)-cycles (Q324868)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Three-colourability of planar graphs with no 5- or triangular \(\{3,6\}\)-cycles
scientific article

    Statements

    Three-colourability of planar graphs with no 5- or triangular \(\{3,6\}\)-cycles (English)
    0 references
    0 references
    0 references
    17 October 2016
    0 references
    Steinberg conjecture
    0 references
    graph colouring
    0 references
    planar graphs
    0 references

    Identifiers