IDEAS home Printed from https://ideas.repec.org/a/spr/jcomop/v33y2017i1d10.1007_s10878-015-9942-2.html
   My bibliography  Save this article

Coupon coloring of some special graphs

Author

Listed:
  • Yongtang Shi

    (Nankai University)

  • Meiqin Wei

    (Nankai University)

  • Jun Yue

    (Shandong Normal University)

  • Yan Zhao

    (Taizhou University)

Abstract

Let G be a graph without isolated vertices. A k-coupon coloring of G is a k-coloring of G such that the neighborhood of every vertex of G contains vertices of all colors from $$[k] =\{1, 2, \ldots , k\}$$ [ k ] = { 1 , 2 , … , k } , which was recently introduced by Chen, Kim, Tait and Verstraete. The coupon coloring number $$\chi _c(G)$$ χ c ( G ) of G is the maximum k for which a k-coupon coloring exists. In this paper, we mainly study the coupon coloring of some special classes of graphs. We determine the coupon coloring numbers of complete graphs, complete k-partite graphs, wheels, cycles, unicyclic graphs, bicyclic graphs and generalised $$\Theta $$ Θ -graphs.

Suggested Citation

  • 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.
    • Handle: RePEc:spr:jcomop:v:33:y:2017:i:1:d:10.1007_s10878-015-9942-2
    DOI: 10.1007/s10878-015-9942-2
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10878-015-9942-2
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10878-015-9942-2?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. 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.
    2. Li, Shasha & Li, Xueliang & Shi, Yongtang, 2015. "Note on the complexity of deciding the rainbow (vertex-) connectedness for bipartite graphs," Applied Mathematics and Computation, Elsevier, vol. 258(C), pages 155-161.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Gao, Zhipeng & Lei, Hui & Wang, Kui, 2020. "Rainbow domination numbers of generalized Petersen graphs," Applied Mathematics and Computation, Elsevier, vol. 382(C).
    2. Banerjee, S. & Henning, Michael A. & Pradhan, D., 2021. "Perfect Italian domination in cographs," Applied Mathematics and Computation, Elsevier, vol. 391(C).
    3. Ma, Yuede & Cai, Qingqiong & Yao, Shunyu, 2019. "Integer linear programming models for the weighted total domination problem," Applied Mathematics and Computation, Elsevier, vol. 358(C), pages 146-150.
    4. Yue, Jun & Wei, Meiqin & Li, Min & Liu, Guodong, 2018. "On the double Roman domination of graphs," Applied Mathematics and Computation, Elsevier, vol. 338(C), pages 669-675.
    5. Li, Shasha & Zhao, Yan & Li, Fengwei & Gu, Ruijuan, 2019. "The generalized 3-connectivity of the Mycielskian of a graph," Applied Mathematics and Computation, Elsevier, vol. 347(C), pages 882-890.
    6. Bermudo, Sergio & Higuita, Robinson A. & Rada, Juan, 2020. "Domination in hexagonal chains," Applied Mathematics and Computation, Elsevier, vol. 369(C).
    7. Chen, He & Jin, Zemin, 2017. "Coupon coloring of cographs," Applied Mathematics and Computation, Elsevier, vol. 308(C), pages 90-95.

    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. Chen, Lin & Li, Xueliang & Liu, Jinfeng, 2017. "The k-proper index of graphs," Applied Mathematics and Computation, Elsevier, vol. 296(C), pages 57-63.
    3. Li, Jingjian & Xu, Shangjin & Cao, Mengyue & Kang, Zhe, 2017. "On tetravalent symmetric dihedrants," Applied Mathematics and Computation, Elsevier, vol. 306(C), pages 49-55.
    4. Cai, Jiansheng & Li, Wenwen & Cai, Wenjing & Dehmer, Matthias, 2023. "List injective coloring of planar graphs," Applied Mathematics and Computation, Elsevier, vol. 439(C).
    5. Li, Jing Jian & Ling, Bo & Liu, Guodong, 2018. "A characterisation on arc-transitive graphs of prime valency," Applied Mathematics and Computation, Elsevier, vol. 325(C), pages 227-233.
    6. 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.
    7. 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:spr:jcomop:v:33:y:2017:i:1:d:10.1007_s10878-015-9942-2. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.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.