The 3-colorability of planar graphs without cycles of length 4, 6 and 9
classification
🧮 math.CO
keywords
cyclesgraphslengthplanarwithoutcolorabilitycolorableprove
read the original abstract
In this paper, we prove that planar graphs without cycles of length 4, 6, 9 are 3-colorable.
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.