IDEAS home Printed from https://ideas.repec.org/a/spr/jcomop/v34y2017i4d10.1007_s10878-017-0137-x.html
   My bibliography  Save this article

Neighbor sum distinguishing total coloring of planar graphs without 4-cycles

Author

Listed:
  • Hongjie Song

    (Hebei University of Technology
    Hebei Province Key Laboratory of Big Data Calculation)

  • Changqing Xu

    (Hebei University of Technology
    Hebei Province Key Laboratory of Big Data Calculation)

Abstract

Let $$G=(V,E)$$ G = ( V , E ) be a graph and $$\phi : V\cup E\rightarrow \{1,2,\ldots ,k\}$$ ϕ : V ∪ E → { 1 , 2 , … , k } be a proper total coloring of G. Let f(v) denote the sum of the color on a vertex v and the colors on all the edges incident with v. The coloring $$\phi $$ ϕ is neighbor sum distinguishing if $$f(u)\ne f(v)$$ f ( u ) ≠ f ( v ) for each edge $$uv\in E(G)$$ u v ∈ E ( G ) . The smallest integer k in such a coloring of G is the neighbor sum distinguishing total chromatic number of G, denoted by $$\chi _{\Sigma }''(G)$$ χ Σ ′ ′ ( G ) . Pilśniak and Woźniak conjectured that $$\chi _{\Sigma }''(G)\le \Delta (G)+3$$ χ Σ ′ ′ ( G ) ≤ Δ ( G ) + 3 for any simple graph. By using the famous Combinatorial Nullstellensatz, we prove that $$\chi _{\Sigma }''(G)\le \max \{\Delta (G)+2, 10\}$$ χ Σ ′ ′ ( G ) ≤ max { Δ ( G ) + 2 , 10 } for planar graph G without 4-cycles. The bound $$\Delta (G)+2$$ Δ ( G ) + 2 is sharp if $$\Delta (G)\ge 8$$ Δ ( G ) ≥ 8 .

Suggested Citation

  • 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.
  • Handle: RePEc:spr:jcomop:v:34:y:2017:i:4:d:10.1007_s10878-017-0137-x
    DOI: 10.1007/s10878-017-0137-x
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10878-017-0137-x
    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-017-0137-x?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. Jihui Wang & Qiaoling Ma & Xue Han & Xiuyun Wang, 2016. "A proper total coloring distinguishing adjacent vertices by sums of planar graphs without intersecting triangles," Journal of Combinatorial Optimization, Springer, vol. 32(2), pages 626-638, August.
    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.
    3. Hualong Li & Laihao Ding & Bingqiang Liu & Guanghui Wang, 2015. "Neighbor sum distinguishing total colorings of planar graphs," Journal of Combinatorial Optimization, Springer, vol. 30(3), pages 675-688, 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. 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. 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.
    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. 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.
    5. 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.
    6. 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.
    7. 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.
    8. You Lu & Chuandong Xu & Zhengke Miao, 2018. "Neighbor sum distinguishing list total coloring of subcubic graphs," Journal of Combinatorial Optimization, Springer, vol. 35(3), pages 778-793, April.
    9. Miaomiao Han & You Lu & Rong Luo & Zhengke Miao, 2018. "Neighbor sum distinguishing total coloring of graphs with bounded treewidth," Journal of Combinatorial Optimization, Springer, vol. 36(1), pages 23-34, July.
    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. Huijuan Wang & Bin Liu & Xiaoli Wang & Guangmo Tong & Weili Wu & Hongwei Gao, 2017. "Total coloring of planar graphs without adjacent chordal 6-cycles," Journal of Combinatorial Optimization, Springer, vol. 34(1), pages 257-265, July.
    12. 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.
    13. 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.

    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:34:y:2017:i:4:d:10.1007_s10878-017-0137-x. 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.