Square of Planar Graphs of Max Degree Four without Five Cycles
Eric CulverStephen G. Hartke
所有作者
Eric CulverStephen G. Hartke
文献摘要
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