Every planar graph without 3-cycles adjacent to 4-cycles and without 6-cycles is (1, 1, 0)-colorable (Q2012890)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Every planar graph without 3-cycles adjacent to 4-cycles and without 6-cycles is (1, 1, 0)-colorable
scientific article

    Statements

    Identifiers