Perfect matchings in claw-free cubic graphs.
Permanents, Pfaffian orientations, and even directed circuits.
Planar graphs without 4-, 5- and 8-cycles are 3-colorable
In this paper we prove that every planar graph without 4, 5 and 8-cycles is 3-colorable.
Pure circuits in cube graphs