Table of Contents Author Guidelines Submit a Manuscript
International Journal of Mathematics and Mathematical Sciences
Volume 2017 (2017), Article ID 5897049, 4 pages
https://doi.org/10.1155/2017/5897049
Research Article

Graphs with Bounded Maximum Average Degree and Their Neighbor Sum Distinguishing Total-Choice Numbers

Department of Mathematics, Faculty of Science, Khon Kaen University, Khon Kaen 40002, Thailand

Correspondence should be addressed to Kittikorn Nakprasit; moc.liamtoh@kantik

Received 31 May 2017; Accepted 4 October 2017; Published 7 November 2017

Academic Editor: Daniel Simson

Copyright © 2017 Patcharapan Jumnongnit and Kittikorn Nakprasit. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. Z. Zhang, X. E. Chen, J. Li, B. Yao, X. Lu, and J. Wang, “On adjacent-vertex-distinguishing total coloring of graphs,” Science China Mathematics, vol. 48, no. 3, pp. 289–299, 2005. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  2. X. Chen, “On the adjacent vertex distinguishing total coloring numbers of graphs with ,” Discrete Mathematics, vol. 308, no. 17, pp. 4003–4007, 2008. View at Publisher · View at Google Scholar · View at MathSciNet
  3. W. Wang and D. Huang, “The adjacent vertex distinguishing total coloring of planar graphs,” Journal of Combinatorial Optimization, vol. 27, no. 2, pp. 379–396, 2014. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  4. W. Wang and P. Wang, “On adjacent-vertex-distinguishing total coloring of K4-minor free graphs,” Sci. China Ser. A, vol. 39, no. 12, pp. 1462–1472, 2009. View at Google Scholar
  5. M. Pilśniak and M. Woźniak, “On the total-neighbor-distinguishing index by sums,” Graphs and Combinatorics, vol. 31, no. 3, pp. 771–782, 2015. View at Publisher · View at Google Scholar · View at MathSciNet
  6. H. Li, B. Liu, and G. Wang, “Neighbor sum distinguishing total colorings of K4-minor free graphs,” Frontiers of Mathematics in China, vol. 8, no. 6, pp. 1351–1366, 2013. View at Publisher · View at Google Scholar · View at MathSciNet
  7. H. Li, L. Ding, B. Liu, and G. Wang, “Neighbor sum distinguishing total colorings of planar graphs,” Journal of Combinatorial Optimization, vol. 30, no. 3, pp. 675–688, 2015. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  8. J. H. Wang, Q. L. Ma, and X. Han, “Neighbor sum distinguishing total colorings of triangle free planar graphs,” Acta Mathematica Sinica, vol. 31, no. 2, pp. 216–224, 2015. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  9. X. Cheng, D. Huang, G. Wang, and J. Wu, “Neighbor sum distinguishing total colorings of planar graphs with maximum degree ,” Discrete Applied Mathematics: The Journal of Combinatorial Algorithms, Informatics and Computational Sciences, vol. 190-191, pp. 34–41, 2015. View at Publisher · View at Google Scholar · View at MathSciNet
  10. C. Qu, G. Wang, J. Wu, and X. Yu, “On the neighbor sum distinguishing total coloring of planar graphs,” Theoretical Computer Science, vol. 609, no. part 1, pp. 162–170, 2016. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  11. H. J. Song, W. H. Pan, X. N. Gong, and C. Q. Xu, “A note on the neighbor sum distinguishing total coloring of planar graphs,” Theoretical Computer Science, vol. 640, pp. 125–129, 2016. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  12. A. J. Dong and G. H. Wang, “Neighbor sum distinguishing total colorings of graphs with bounded maximum average degree,” Acta Mathematica Sinica, vol. 30, no. 4, pp. 703–709, 2014. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  13. V. G. Vizing, “Vertex colorings with given colors” (Russian), Metody Diskret. Analiz., 29, 3–10.
  14. P. Erdös, A. L. Rubin, and H. Taylor, “Choosability in graphs,” in In Proceedings of the West Coast Conference on Combinatorics, Graph Theory and Computing, Arcata, Congr. Num., vol. 26, pp. 125–157, 1979.
  15. C. Qu, G. Wang, G. Yan, and X. Yu, “Neighbor sum distinguishing total choosability of planar graphs,” Journal of Combinatorial Optimization, vol. 32, no. 3, pp. 906–916, 2016. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  16. J. Yao, X. Yu, G. Wang, and C. Xu, “Neighbor sum (set) distinguishing total choosability of d-degenerate graphs,” Graphs and Combinatorics, vol. 32, no. 4, pp. 1611–1620, 2016. View at Publisher · View at Google Scholar · View at MathSciNet
  17. J. Wang, J. Cai, and Q. Ma, “Neighbor sum distinguishing total choosability of planar graphs without 4-cycles,” Discrete Applied Mathematics: The Journal of Combinatorial Algorithms, Informatics and Computational Sciences, vol. 206, pp. 215–219, 2016. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus