IDEAS home Printed from https://ideas.repec.org/a/eee/apmaco/v446y2023ics009630032300053x.html
   My bibliography  Save this article

On L(p,q)-labelling of planar graphs without cycles of length four

Author

Listed:
  • Hou, Jianfeng
  • Jin, Yindong
  • Li, Heng
  • Miao, Lianying
  • Zhao, Qian

Abstract

Let p,q be integers with p≥q≥0 and let G be a graph. A k−L(p,q)−labeling of G is a function φ:V(G)→{0,1,…,k} such that |φ(x)−φ(y)|≥p if xy∈E(G), and |φ(x)−φ(y)|≥q if x and y have at least one common neighbor in G. Suppose that G is a planar graph with maximum degree Δ, and without cycles of length four. We show that λp,q(G)≤(2q−1)Δ+8p+10q−9, which improves the bound given by Zhu, Hou, Chen and Lv [The L(p,q)-labelling of planar graphs without 4-cycles, Discrete Appl. Math. 162 (2014) 355–363].

Suggested Citation

  • Hou, Jianfeng & Jin, Yindong & Li, Heng & Miao, Lianying & Zhao, Qian, 2023. "On L(p,q)-labelling of planar graphs without cycles of length four," Applied Mathematics and Computation, Elsevier, vol. 446(C).
    • Handle: RePEc:eee:apmaco:v:446:y:2023:i:c:s009630032300053x
    DOI: 10.1016/j.amc.2023.127884
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S009630032300053X
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.amc.2023.127884?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. Junlei Zhu & Yuehua Bu & Miltiades P. Pardalos & Hongwei Du & Huijuan Wang & Bin Liu, 2018. "Optimal channel assignment and L(p, 1)-labeling," Journal of Global Optimization, Springer, vol. 72(3), pages 539-552, November.
    2. Miao Zhang & Min Chen & Yiqiao Wang, 2017. "A sufficient condition for planar graphs with girth 5 to be (1, 7)-colorable," Journal of Combinatorial Optimization, Springer, vol. 33(3), pages 847-865, April.
    3. Hou, Jianfeng & Zhu, Hongguo, 2020. "Choosability with union separation of planar graphs without cycles of length 4," Applied Mathematics and Computation, Elsevier, vol. 386(C).
    4. Clément Charpentier & Mickaël Montassier & André Raspaud, 2013. "L(p,q)-labeling of sparse graphs," Journal of Combinatorial Optimization, Springer, vol. 25(4), pages 646-660, May.
    5. Min Chen & Yingying Fan & Yiqiao Wang & Weifan Wang, 2017. "A sufficient condition for planar graphs to be (3, 1)-choosable," Journal of Combinatorial Optimization, Springer, vol. 34(4), pages 987-1011, November.
    Full references (including those not matched with items on IDEAS)

    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. Hou, Jianfeng & Zhu, Hongguo, 2020. "Choosability with union separation of planar graphs without cycles of length 4," Applied Mathematics and Computation, Elsevier, vol. 386(C).
    2. Zhang, Ganchao & Chen, Min & Wang, Weifan, 2024. "A sufficient condition for planar graphs with girth 5 to be (1,6)-colorable," Applied Mathematics and Computation, Elsevier, vol. 474(C).
    3. Hou, Jianfeng & Zhu, Hongguo, 2023. "On (2,r)-choosability of planar graphs without short cycles," Applied Mathematics and Computation, Elsevier, vol. 444(C).

    More about this item

    Keywords

    L(p; q)-coloring; Planar graph; Cycle;
    All these keywords.

    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:eee:apmaco:v:446:y:2023:i:c:s009630032300053x. 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: Catherine Liu (email available below). General contact details of provider: https://www.journals.elsevier.com/applied-mathematics-and-computation .

    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.