IDEAS home Printed from https://ideas.repec.org/a/eee/apmaco/v314y2017icp456-468.html
   My bibliography  Save this article

Neighbor sum distinguishing total chromatic number of planar graphs with maximum degree 10

Author

Listed:
  • Yang, Donglei
  • Sun, Lin
  • Yu, Xiaowei
  • Wu, Jianliang
  • Zhou, Shan

Abstract

Given a simple graph G, a proper total-k-coloring ϕ:V(G)∪E(G)→{1,2,…,k} is called neighbor sum distinguishing if Sϕ(u) ≠ Sϕ(v) for any two adjacent vertices u, v ∈ V(G), where Sϕ(u) is the sum of the color of u and the colors of the edges incident with u. It has been conjectured by Pilśniak and Woźniak that Δ(G)+3 colors enable the existence of a neighbor sum distinguishing total coloring. The conjecture is confirmed for any graph with maximum degree at most 3 and for planar graph with maximum degree at least 11. We prove that the conjecture holds for any planar graph G with Δ(G)=10. Moreover, for any planar graph G with Δ(G) ≥ 11, Δ(G)+2 colors guarantee such a total coloring, and the upper bound Δ(G)+2 is tight.

Suggested Citation

  • Yang, Donglei & Sun, Lin & Yu, Xiaowei & Wu, Jianliang & Zhou, Shan, 2017. "Neighbor sum distinguishing total chromatic number of planar graphs with maximum degree 10," Applied Mathematics and Computation, Elsevier, vol. 314(C), pages 456-468.
    • Handle: RePEc:eee:apmaco:v:314:y:2017:i:c:p:456-468
    DOI: 10.1016/j.amc.2017.06.002
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0096300317304046
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.amc.2017.06.002?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Weifan Wang & Danjun Huang, 2014. "The adjacent vertex distinguishing total coloring of planar graphs," Journal of Combinatorial Optimization, Springer, vol. 27(2), pages 379-396, February.
    2. Cunquan Qu & Guanghui Wang & Guiying Yan & Xiaowei Yu, 2016. "Neighbor sum distinguishing total choosability of planar graphs," Journal of Combinatorial Optimization, Springer, vol. 32(3), pages 906-916, October.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Jingjing Huo & Yiqiao Wang & Weifan Wang & Wenjing Xia, 2020. "Neighbor-distinguishing total coloring of planar graphs with maximum degree twelve," Journal of Combinatorial Optimization, Springer, vol. 39(1), pages 246-272, January.
    2. Yulin Chang & Qiancheng Ouyang & Guanghui Wang, 2019. "Adjacent vertex distinguishing total choosability of planar graphs with maximum degree at least 10," Journal of Combinatorial Optimization, Springer, vol. 38(1), pages 185-196, July.
    3. Chao Song & Changqing Xu, 2020. "Neighbor sum distinguishing total colorings of IC-planar graphs with maximum degree 13," Journal of Combinatorial Optimization, Springer, vol. 39(1), pages 293-303, January.
    4. H. Hocquard & J. Przybyło, 2020. "On the total neighbour sum distinguishing index of graphs with bounded maximum average degree," Journal of Combinatorial Optimization, Springer, vol. 39(2), pages 412-424, February.
    5. Donghan Zhang, 2021. "Neighbor Sum Distinguishing Total Choosability of IC-Planar Graphs without Theta Graphs Θ 2,1,2," Mathematics, MDPI, vol. 9(7), pages 1-11, March.
    6. Xu, Changqing & Li, Jianguo & Ge, Shan, 2018. "Neighbor sum distinguishing total chromatic number of planar graphs," Applied Mathematics and Computation, Elsevier, vol. 332(C), pages 189-196.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Patcharapan Jumnongnit & Kittikorn Nakprasit, 2017. "Graphs with Bounded Maximum Average Degree and Their Neighbor Sum Distinguishing Total-Choice Numbers," International Journal of Mathematics and Mathematical Sciences, Hindawi, vol. 2017, pages 1-4, November.
    2. Xu, Changqing & Li, Jianguo & Ge, Shan, 2018. "Neighbor sum distinguishing total chromatic number of planar graphs," Applied Mathematics and Computation, Elsevier, vol. 332(C), pages 189-196.
    3. Tong Li & Cunquan Qu & Guanghui Wang & Xiaowei Yu, 2017. "Neighbor product distinguishing total colorings," Journal of Combinatorial Optimization, Springer, vol. 33(1), pages 237-253, January.
    4. Liting Wang & Huijuan Wang & Weili Wu, 2023. "Minimum total coloring of planar graphs with maximum degree 8," Journal of Combinatorial Optimization, Springer, vol. 45(2), pages 1-11, March.
    5. Enqiang Zhu & Chanjuan Liu & Jiguo Yu, 2020. "Neighbor product distinguishing total colorings of 2-degenerate graphs," Journal of Combinatorial Optimization, Springer, vol. 39(1), pages 72-76, January.
    6. Jingjing Huo & Yiqiao Wang & Weifan Wang & Wenjing Xia, 2020. "Neighbor-distinguishing total coloring of planar graphs with maximum degree twelve," Journal of Combinatorial Optimization, Springer, vol. 39(1), pages 246-272, January.
    7. Lin Sun & Xiaohan Cheng & Jianliang Wu, 2017. "The adjacent vertex distinguishing total coloring of planar graphs without adjacent 4-cycles," Journal of Combinatorial Optimization, Springer, vol. 33(2), pages 779-790, February.
    8. Hongjie Song & Changqing Xu, 2017. "Neighbor sum distinguishing total coloring of planar graphs without 4-cycles," Journal of Combinatorial Optimization, Springer, vol. 34(4), pages 1147-1158, November.
    9. Xiaohan Cheng & Jianliang Wu, 2018. "The adjacent vertex distinguishing total choosability of planar graphs with maximum degree at least eleven," Journal of Combinatorial Optimization, Springer, vol. 35(1), pages 1-13, January.
    10. Chao Song & Changqing Xu, 2020. "Neighbor sum distinguishing total colorings of IC-planar graphs with maximum degree 13," Journal of Combinatorial Optimization, Springer, vol. 39(1), pages 293-303, January.
    11. Weifan Wang & Jingjing Huo & Danjun Huang & Yiqiao Wang, 2019. "Planar graphs with $$\Delta =9$$Δ=9 are neighbor-distinguishing totally 12-colorable," Journal of Combinatorial Optimization, Springer, vol. 37(3), pages 1071-1089, April.
    12. Cunquan Qu & Guanghui Wang & Guiying Yan & Xiaowei Yu, 2016. "Neighbor sum distinguishing total choosability of planar graphs," Journal of Combinatorial Optimization, Springer, vol. 32(3), pages 906-916, October.
    13. Jingjing Yao & Xiaowei Yu & Guanghui Wang & Changqing Xu, 2017. "Neighbor sum distinguishing total coloring of 2-degenerate graphs," Journal of Combinatorial Optimization, Springer, vol. 34(1), pages 64-70, July.
    14. Donghan Zhang, 2021. "Neighbor Sum Distinguishing Total Choosability of IC-Planar Graphs without Theta Graphs Θ 2,1,2," Mathematics, MDPI, vol. 9(7), pages 1-11, March.
    15. Renyu Xu & Jianliang Wu & Jin Xu, 2016. "Neighbor sum distinguishing total coloring of graphs embedded in surfaces of nonnegative Euler characteristic," Journal of Combinatorial Optimization, Springer, vol. 31(4), pages 1430-1442, May.
    16. Xiaohan Cheng & Guanghui Wang & Jianliang Wu, 2017. "The adjacent vertex distinguishing total chromatic numbers of planar graphs with $$\Delta =10$$ Δ = 10," Journal of Combinatorial Optimization, Springer, vol. 34(2), pages 383-397, August.
    17. Yulin Chang & Qiancheng Ouyang & Guanghui Wang, 2019. "Adjacent vertex distinguishing total choosability of planar graphs with maximum degree at least 10," Journal of Combinatorial Optimization, Springer, vol. 38(1), pages 185-196, July.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:apmaco:v:314:y:2017:i:c:p:456-468. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: https://www.journals.elsevier.com/applied-mathematics-and-computation .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.