Square of Planar Graphs of Max Degree Four without Five Cycles
Eric Culver, Stephen G. Hartke·2022-10-25·via math.CO updates on arXiv.org
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