Square of Planar Graphs of Max Degree Four without Five Cycles
classification
🧮 math.CO
keywords
planarchoosabilitycyclesdegreefivegraphssquarewithout
read the original 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
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.