IDEAS home Printed from https://ideas.repec.org/a/spr/jcomop/v34y2017i1d10.1007_s10878-016-0063-3.html
   My bibliography  Save this article

Total coloring of planar graphs without adjacent chordal 6-cycles

Author

Listed:
  • Huijuan Wang

    (Qingdao University)

  • Bin Liu

    (Ocean University of China)

  • Xiaoli Wang

    (Ocean University of China)

  • Guangmo Tong

    (University of Texas at Dallas)

  • Weili Wu

    (University of Texas at Dallas)

  • Hongwei Gao

    (Qingdao University)

Abstract

A total coloring of a graph G is a coloring such that no two adjacent or incident elements receive the same color. In this field there is a famous conjecture, named Total Coloring Conjecture, saying that the the total chromatic number of each graph G is at most $$\Delta +2$$ Δ + 2 . Let G be a planar graph with maximum degree $$\Delta \ge 7$$ Δ ≥ 7 and without adjacent chordal 6-cycles, that is, two cycles of length 6 with chord do not share common edges. In this paper, it is proved that the total chromatic number of G is $$\Delta +1$$ Δ + 1 , which partly confirmed Total Coloring Conjecture.

Suggested Citation

  • 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.
  • Handle: RePEc:spr:jcomop:v:34:y:2017:i:1:d:10.1007_s10878-016-0063-3
    DOI: 10.1007/s10878-016-0063-3
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10878-016-0063-3
    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-016-0063-3?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. Hua Cai & Jianliang Wu & Lin Sun, 2016. "Total coloring of planar graphs without short cycles," Journal of Combinatorial Optimization, Springer, vol. 31(4), pages 1650-1664, May.
    2. 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.
    3. Huijuan Wang & Lidong Wu & Weili Wu & Panos Pardalos & Jianliang Wu, 2014. "Minimum total coloring of planar graph," Journal of Global Optimization, Springer, vol. 60(4), pages 777-791, December.
    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. 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.

    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. 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.
    3. Lin Sun & Jian-Liang Wu, 2017. "On (p, 1)-total labelling of planar graphs," Journal of Combinatorial Optimization, Springer, vol. 33(1), pages 317-325, January.
    4. 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.
    5. 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.
    6. Huijuan Wang & Panos M. Pardalos & Bin Liu, 2019. "Optimal channel assignment with list-edge coloring," Journal of Combinatorial Optimization, Springer, vol. 38(1), pages 197-207, July.
    7. Hua Cai & Jianliang Wu & Lin Sun, 2016. "Total coloring of planar graphs without short cycles," Journal of Combinatorial Optimization, Springer, vol. 31(4), pages 1650-1664, May.
    8. 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.
    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. Huijuan Wang & Bin Liu & Xin Zhang & Lidong Wu & Weili Wu & Hongwei Gao, 2016. "List edge and list total coloring of planar graphs with maximum degree 8," Journal of Combinatorial Optimization, Springer, vol. 32(1), pages 188-197, July.
    11. 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.
    12. 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.
    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.
    14. 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.
    15. Huijuan Wang & Bin Liu & Yan Gu & Xin Zhang & Weili Wu & Hongwei Gao, 2017. "Total coloring of planar graphs without adjacent short cycles," Journal of Combinatorial Optimization, Springer, vol. 33(1), pages 265-274, January.
    16. Huijuan Wang & Bin Liu & Ling Gai & Hongwei Du & Jianliang Wu, 2018. "Minimum choosability of planar graphs," Journal of Combinatorial Optimization, Springer, vol. 36(1), pages 13-22, July.
    17. 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:34:y:2017:i:1:d:10.1007_s10878-016-0063-3. 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.