IDEAS home Printed from https://ideas.repec.org/a/gam/jmathe/v13y2025i2p190-d1562805.html
   My bibliography  Save this article

DP-4-Colorability on Planar Graphs Excluding 7-Cycles Adjacent to 4- or 5-Cycles

Author

Listed:
  • Fan Yang

    (School of Mathematics and Science, Nanjing Tech University, Nanjing 211816, China)

  • Xiangwen Li

    (School of Mathematics & Statistics, Central China Normal University, Wuhan 430079, China)

  • Ziwen Huang

    (School of Mathematics and Computer Science & Center of Applied Mathematics, Yichun University, Yichun 336000, China)

Abstract

In order to resolve Borodin’s Conjecture, DP-coloring was introduced in 2017 to extend the concept of list coloring. In previous works, it is proved that every planar graph without 7-cycles and butterflies is DP-4-colorable. And any planar graph that does not have 5-cycle adjacent to 6-cycle is DP-4-colorable. The existing research mainly focus on the forbidden adjacent cycles that guarantee the DP-4-colorability for planar graph. In this paper, we demonstrate that any planar graph G that excludes 7-cycles adjacent to k -cycles (for each k = 4 , 5 ), and does not feature a Near-bow-tie as an induced subgraph, is DP-4-colorable. This result extends the findings of the previous works mentioned above.

Suggested Citation

  • Fan Yang & Xiangwen Li & Ziwen Huang, 2025. "DP-4-Colorability on Planar Graphs Excluding 7-Cycles Adjacent to 4- or 5-Cycles," Mathematics, MDPI, vol. 13(2), pages 1-18, January.
    • Handle: RePEc:gam:jmathe:v:13:y:2025:i:2:p:190-:d:1562805
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/13/2/190/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/2227-7390/13/2/190/
    Download Restriction: no
    ---><---

    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:gam:jmathe:v:13:y:2025:i:2:p:190-:d:1562805. 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: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.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.