Bulletin of the Korean Mathematical Society (대한수학회보)

Korean Mathematical Society (대한수학회)
권호 표지
DOI QR코드

DOI QR Code

A SUFFICIENT CONDITION FOR ACYCLIC 5-CHOOSABILITY OF PLANAR GRAPHS WITHOUT 5-CYCLES

  • Sun, Lin (Department of Mathematics and Finance Chongqing University of Arts and Sciences)
  • Received : 2017.01.19
  • Accepted : 2017.07.21
  • Published : 2018.03.31
Download PDF
⟨ Previous Next ⟩

Abstract

A proper vertex coloring of a graph G is acyclic if G contains no bicolored cycle. A graph G is acyclically L-list colorable if for a given list assignment $L=\{L(v):v{\in}V(G)\}$, there exists an acyclic coloring ${\phi}$ of G such that ${\phi}(v){\in}L(v)$ for all $v{\in}V(G)$ A graph G is acyclically k-choosable if G is acyclically L-list colorable for any list assignment with $L(v){\geq}k$ for all $v{\in}V(G)$. Let G be a planar graph without 5-cycles and adjacent 4-cycles. In this article, we prove that G is acyclically 5-choosable if every vertex v in G is incident with at most one i-cycle, $i {\in}\{6,7\}$.

Keywords

References

  1. J. A. Bondy and U. S. R. Murty, Graph Theory with Applications, MacMillan, London, 1976.
  2. O. V. Borodin, D. G. Fon-Der Flass, A. V. Kostochka, A. Raspaud, and E. Sopena, Acyclic list 7-coloring of planar graphs, J. Graph Theory 40 (2002), no. 2, 83-90. https://doi.org/10.1002/jgt.10035
  3. O. V. Borodin and A. O. Ivanova, Acyclic 5-choosability of planar graphs without 4-cycles, Siberian Math. J. 52 (2011), no. 3, 411-425. https://doi.org/10.1134/S0037446611030049
  4. O. V. Borodin and A. O. Ivanova, Acyclic 5-choosability of planar graphs without adjacent short cycles, J. Graph Theory 68 (2011), no. 2, 169-176. https://doi.org/10.1002/jgt.20549
  5. O. V. Borodin and A. O. Ivanova, Acyclic 4-choosability of planar graphs without adjacent short cycles, Discrete Math. 312 (2012), no. 22, 3335-3341. https://doi.org/10.1016/j.disc.2012.07.038
  6. O. V. Borodin and A. O. Ivanova, Acyclic 4-choosability of planar graphs with no 4- and 5-cycles, J. Graph Theory 72 (2013), no. 4, 374-397. https://doi.org/10.1002/jgt.21647
  7. O. V. Borodin, A. O. Ivanova, and A. Raspaud, Acyclic 4-choosability of planar graphs with neither 4-cycles nor triangular 6-cycles, Discrete Math. 310 (2010), no. 21, 2946-2950. https://doi.org/10.1016/j.disc.2010.07.001
  8. M. Chen and A. Raspaud, A sufficient condition for planar graphs to be acyclically 5-choosable, J. Graph Theory 70 (2012), no. 2, 135-151. https://doi.org/10.1002/jgt.20604
  9. M. Chen and A. Raspaud, Planar graphs without 4- and 5-cycles are acyclically 4-choosable, Discrete Appl. Math. 161 (2013), no. 7-8, 921-931. https://doi.org/10.1016/j.dam.2012.11.006
  10. M. Chen, A. Raspaud, N. Roussel, and X. D. Zhu, Acyclic 4-choosability of planar graphs, Discrete Math. 311 (2011), no. 1, 92-101. https://doi.org/10.1016/j.disc.2010.10.003
  11. M. Chen and W. F. Wang, Acyclic 5-choosability of planar graphs without 4-cycles, Discrete Math. 308 (2008), no. 24, 6216-6225. https://doi.org/10.1016/j.disc.2007.11.076
  12. B. Grunbaum, Acyclic colorings of planar graphs, Israel J. Math. 14 (1973), no. 3, 390-408. https://doi.org/10.1007/BF02764716
  13. J. F. Hou and G. Z. Liu, Every toroidal graph is acyclically 8-choosable, Acta Math. Sin. (Engl. Ser.) 30 (2014), no. 2, 343-352. https://doi.org/10.1007/s10114-013-1497-5
  14. M. Montassier, Acyclic 4-choosability of Planar Graphs with Girth at Least 5, Graph theory in Paris, 299-310, Trends Math., Birkhauser, Basel, 2007.
  15. M. Montassier, P. Ochem, and A. Raspaud, On the acyclic choosability of graphs, J. Graph Theory 51 (2006), no. 4, 281-300. https://doi.org/10.1002/jgt.20134
  16. M. Montassier, A. Raspaud, and W. Wang, Acyclic 5-choosability of planar graphs without small cycles, J. Graph Theory 54 (2007), no. 3, 245-260. https://doi.org/10.1002/jgt.20206
  17. W. F. Wang and M. Chen, Planar graphs without 4-cycles are 6-choosable, J. Graph Theory 61 (2009), no. 4, 307-323. https://doi.org/10.1002/jgt.20381
  18. W. F. Wang, G. Zhang, and M. Chen, Acyclic 6-choosability of planar graphs without adjacent short cycles, Sci. China Math. 57 (2014), no. 1, 197-209. https://doi.org/10.1007/s11425-013-4572-6