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

On list r-hued coloring of outer-1-planar graphs

Author

Listed:
  • Liang, Lingmei
  • Liu, Fengxia
  • Lai, Hong-Jian

Abstract

Let L be list assignment of colors available for vertices of a graph G, an (L,r)-coloring of G is a proper coloring c such that for any vertex v∈V(G), we have c(v)∈L(v) and |c(N(v))|≥min{d(v),r}. The r-hued list chromatic number of G, denoted as χL,r(G), is the least integer k, such that for list assignment L satisfying |L(v)|=k∀v∈V(G), G has an (L,r)-coloring. A graph G is an outer-1-planar graph if G has a drawing on the plane such that all vertices of V(G) are located on the outer face of this drawing, and each edge can cross at most one other edge. For any positive integer r, we completely determine the upper bound of list r-hued chromatic number for all outer-1-planar graphs. This extended a former result in [Discrete Mathematics and Theoretical Computer Science, 23:3 (2021)].

Suggested Citation

  • Liang, Lingmei & Liu, Fengxia & Lai, Hong-Jian, 2023. "On list r-hued coloring of outer-1-planar graphs," Applied Mathematics and Computation, Elsevier, vol. 440(C).
    • Handle: RePEc:eee:apmaco:v:440:y:2023:i:c:s0096300322007299
    DOI: 10.1016/j.amc.2022.127658
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0096300322007299
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.amc.2022.127658?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. Huang, Danjun & Wang, Yiqiao & Lv, Jing & Yang, Yanping & Wang, Weifan, 2019. "List coloring and diagonal coloring for plane graphs of diameter two," Applied Mathematics and Computation, Elsevier, vol. 363(C), pages 1-1.
    2. Xin Zhang, 2017. "Total coloring of outer-1-planar graphs with near-independent crossings," Journal of Combinatorial Optimization, Springer, vol. 34(3), pages 661-675, October.
    3. Chen, Ye & Fan, Suohai & Lai, Hong-Jian & Song, Huimin & Xu, Murong, 2020. "Decomposition and r-hued Coloring of K4(7)-minor free graphs," Applied Mathematics and Computation, Elsevier, vol. 384(C).
    4. Dailly, Antoine & Duchêne, Éric & Parreau, Aline & Sidorowicz, Elżbieta, 2022. "The neighbour sum distinguishing relaxed edge colouring," Applied Mathematics and Computation, Elsevier, vol. 419(C).
    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. Wang, Yiqiao & Zheng, Lina, 2020. "Computation on the difference of Zagreb indices of maximal planar graphs with diameter two," Applied Mathematics and Computation, Elsevier, vol. 377(C).
    2. Shu-Yu Cui & Yiqiao Wang & Danjun Huang & Hongwei Du & Weifan Wang, 2022. "Structure and pancyclicity of maximal planar graphs with diameter two," Journal of Combinatorial Optimization, Springer, vol. 43(1), pages 1-27, January.

    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:440:y:2023:i:c:s0096300322007299. 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.