Square of Planar Graphs of Max Degree Four without Five Cycles
arXiv:2210.13618
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
16 pages, 24 figures