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

List injective coloring of planar graphs

Author

Listed:
  • Cai, Jiansheng
  • Li, Wenwen
  • Cai, Wenjing
  • Dehmer, Matthias

Abstract

An injective coloring is a vertex coloring (not necessarily proper) such that any two vertices sharing a common neighbor receive distinct colors. A graph G is called injectively k-choosable, if for any color list L with admissible colors on V(G) of size k, there is an injective coloring φ such that φ(v)∈L(v) whenever v∈V(G). The list injective chromatic number, denoted by χil(G), is the least k for which G is injectively k-choosable. We focus on the study of list injective coloring on planar graphs which has disjoint 5−-cycles and show that χil(G)≤Δ+3 if Δ≥18 and χil(G)≤Δ+4 if Δ≥12.

Suggested Citation

  • Cai, Jiansheng & Li, Wenwen & Cai, Wenjing & Dehmer, Matthias, 2023. "List injective coloring of planar graphs," Applied Mathematics and Computation, Elsevier, vol. 439(C).
    • Handle: RePEc:eee:apmaco:v:439:y:2023:i:c:s0096300322006932
    DOI: 10.1016/j.amc.2022.127631
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0096300322006932
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.amc.2022.127631?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. 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.
    2. Min Chen & Geňa Hahn & André Raspaud & Weifan Wang, 2012. "Some results on the injective chromatic number of graphs," Journal of Combinatorial Optimization, Springer, vol. 24(3), pages 299-318, October.
    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. Yue, Jun & Zhang, Shiliang & Zhang, Xia, 2016. "Note on the perfect EIC-graphs," Applied Mathematics and Computation, Elsevier, vol. 289(C), pages 481-485.
    2. Qiufen Ni & Smita Ghosh & Chuanhe Huang & Weili Wu & Rong Jin, 2021. "Discount allocation for cost minimization in online social networks," Journal of Combinatorial Optimization, Springer, vol. 41(1), pages 213-233, January.
    3. Qing Cui & Zhenmeng Han, 2024. "Injective edge-coloring of claw-free subcubic graphs," Journal of Combinatorial Optimization, Springer, vol. 47(5), pages 1-32, July.
    4. Yongtang Shi & Meiqin Wei & Jun Yue & Yan Zhao, 2017. "Coupon coloring of some special graphs," Journal of Combinatorial Optimization, Springer, vol. 33(1), pages 156-164, January.
    5. Yuehua Bu & Kai Lu & Sheng Yang, 2015. "Two smaller upper bounds of list injective chromatic number," Journal of Combinatorial Optimization, Springer, vol. 29(2), pages 373-388, February.

    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:439:y:2023:i:c:s0096300322006932. 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.