IDEAS home Printed from https://ideas.repec.org/a/hin/jnddns/3196540.html
   My bibliography  Save this article

A Sufficient Condition for Planar Graphs of Maximum Degree 6 to be Totally 7-Colorable

Author

Listed:
  • Enqiang Zhu
  • Yongsheng Rao

Abstract

A total - coloring of a graph is an assignment of colors to its vertices and edges such that no two adjacent or incident elements receive the same color. The total coloring conjecture (TCC) states that every simple graph has a total - coloring, where is the maximum degree of . This conjecture has been confirmed for planar graphs with maximum degree at least 7 or at most 5, i.e., the only open case of TCC is that of maximum degree 6. It is known that every planar graph of or with some restrictions has a total - coloring. In particular, in (Shen and Wang, 2009), the authors proved that every planar graph with maximum degree 6 and without 4-cycles has a total 7-coloring. In this paper, we improve this result by showing that every diamond-free and house-free planar graph of maximum degree 6 is totally 7-colorable if every 6-vertex is not incident with two adjacent four cycles or three cycles of size for some .

Suggested Citation

  • Enqiang Zhu & Yongsheng Rao, 2020. "A Sufficient Condition for Planar Graphs of Maximum Degree 6 to be Totally 7-Colorable," Discrete Dynamics in Nature and Society, Hindawi, vol. 2020, pages 1-8, April.
    • Handle: RePEc:hin:jnddns:3196540
    DOI: 10.1155/2020/3196540
    as

    Download full text from publisher

    File URL: http://downloads.hindawi.com/journals/DDNS/2020/3196540.pdf
    Download Restriction: no
    File URL: http://downloads.hindawi.com/journals/DDNS/2020/3196540.xml
    Download Restriction: no
    File URL: https://libkey.io/10.1155/2020/3196540?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
    ---><---

    More about this item

    Statistics

    Access and download statistics

    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:hin:jnddns:3196540. 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.

    We have no bibliographic references for this item. You can help adding them by using 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: Mohamed Abdelhakeem (email available below). General contact details of provider: https://www.hindawi.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.