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

Every Planar Graph with the Distance of 5 − -Cycles at Least 3 from Each Other Is DP-3-Colorable

Author

Listed:
  • Yueying Zhao

    (School of Mathematics, China University of Mining and Technology, Xuzhou 221116, China
    School of Mathematics and Statistics, Xuzhou University of Technology, Xuzhou 221000, China)

  • Lianying Miao

    (School of Mathematics, China University of Mining and Technology, Xuzhou 221116, China)

Abstract

DP-coloring was introduced by Dvořák and Postle [J. Comb. Theory Ser. B 2018, 129, 38–54]. In this paper, we prove that every planar graph in which the 5 − -cycles are at distance of at least 3 from each other is DP-3-colorable, which improves the result of Montassier et al. [Inform. Process. Lett. 2008, 107, 3–4] and Yin and Yu [Discret. Math. 2019, 342, 2333–2341].

Suggested Citation

  • Yueying Zhao & Lianying Miao, 2020. "Every Planar Graph with the Distance of 5 − -Cycles at Least 3 from Each Other Is DP-3-Colorable," Mathematics, MDPI, vol. 8(11), pages 1-13, November.
    • Handle: RePEc:gam:jmathe:v:8:y:2020:i:11:p:1920-:d:438717
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/8/11/1920/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/2227-7390/8/11/1920/
    Download Restriction: no
    ---><---

    More about this item

    Keywords

    DP-coloring; planar graphs;

    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:gam:jmathe:v:8:y:2020:i:11:p:1920-:d:438717. 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.