IDEAS home Printed from https://ideas.repec.org/a/spr/jcomop/v39y2020i1d10.1007_s10878-019-00455-5.html
   My bibliography  Save this article

Neighbor product distinguishing total colorings of 2-degenerate graphs

Author

Listed:
  • Enqiang Zhu

    (Guangzhou University)

  • Chanjuan Liu

    (Dalian University of Technology)

  • Jiguo Yu

    (Qufu Normal University)

Abstract

A total-k-neighbor product distinguishing-coloring of a graph G is a mapping $$\phi : V(G)\cup E(G)\rightarrow \{1,2,\ldots ,k\}$$ϕ:V(G)∪E(G)→{1,2,…,k} such that (1) any two adjacent or incident elements in $$V(G)\cup E(G)$$V(G)∪E(G) receive different colors, and (2) for each edge $$uv\in E(G)$$uv∈E(G), $$f_{\phi }(u)\ne f_{\phi }(v)$$fϕ(u)≠fϕ(v), where $$f_{\phi }(x)$$fϕ(x) denotes the product of the colors assigned to a vertex x and its incident edges under $$\phi $$ϕ. The smallest integer k for which such a coloring of G exists is denoted by $$\chi ^{\prime \prime }_{\prod }(G)$$χ∏″(G). In this paper, by using the famous Combinatorial Nullstellensatz, we show that if G is a 2-degenerate graph with maximum degree $$\varDelta (G)$$Δ(G), then $$\chi ^{\prime \prime }_{\prod }(G) \le \max \{\varDelta (G)+2,7\}$$χ∏″(G)≤max{Δ(G)+2,7}. Our results imply the results on $$K_4$$K4-minor free graphs with $$\varDelta (G)\ge 5$$Δ(G)≥5 (Li et al. in J Comb Optim 33:237–253, 2017).

Suggested Citation

  • 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.
    • Handle: RePEc:spr:jcomop:v:39:y:2020:i:1:d:10.1007_s10878-019-00455-5
    DOI: 10.1007/s10878-019-00455-5
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10878-019-00455-5
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10878-019-00455-5?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. Haiying Wang, 2007. "On the adjacent vertex-distinguishing total chromatic numbers of the graphs with Δ (G) = 3," Journal of Combinatorial Optimization, Springer, vol. 14(1), pages 87-109, July.
    2. 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.
    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.
    Full references (including those not matched with items on IDEAS)

    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. 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.
    3. 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.
    4. 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.
    5. 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.
    6. 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.
    7. 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.
    8. 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.
    9. 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.
    10. 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.
    11. 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.
    12. 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.
    13. Joanna Skowronek-Kaziów, 2017. "Graphs with multiplicative vertex-coloring 2-edge-weightings," Journal of Combinatorial Optimization, Springer, vol. 33(1), pages 333-338, January.
    14. 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.

    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:spr:jcomop:v:39:y:2020:i:1:d:10.1007_s10878-019-00455-5. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.