Square of Planar Graphs of Max Degree Four without Five Cycles
Abstract
We show that the choosability of the square of planar graphs of max degree 4 without five cycles is at most 12. Keywords: planar graph, choosability AMS Mathematics Subject Classification: 05C15
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.