Decomposing a planar graph without cycles of length 5 into a matching and a 3-colorable graph (Q458589)

From MaRDI portal
Revision as of 02:41, 9 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
scientific article
Language Label Description Also known as
English
Decomposing a planar graph without cycles of length 5 into a matching and a 3-colorable graph
scientific article

    Statements

    Decomposing a planar graph without cycles of length 5 into a matching and a 3-colorable graph (English)
    0 references
    0 references
    0 references
    8 October 2014
    0 references
    Steinberg's conjecture
    0 references
    weak Bordeaux conjecture
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

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