Planar graphs without 3-,7-, and 8-cycles are 3-choosable

Abstract

We prove that every planar triangle-free graph without 7- and 8-cycles is 3-choosable.

Keywords

• Planar
• graphs
• without
• 8-cycles
• 3-choosable