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

Multicolorful connectivity of trees

Author

Listed:
  • Jin, Zemin
  • Gui, Xueyao
  • Wang, Kaijun

Abstract

In 2011, Caro and Yuster introduced the colorful monochromatic connectivity of graphs, which considers the maximum number of colors used in an edge-coloring of a graph such that for any two vertices, there is a monochromatic path joining them. In this paper, we replace the condition monochromatic path with the path with at most k colors and determine the color number for trees.

Suggested Citation

  • Jin, Zemin & Gui, Xueyao & Wang, Kaijun, 2021. "Multicolorful connectivity of trees," Applied Mathematics and Computation, Elsevier, vol. 402(C).
    • Handle: RePEc:eee:apmaco:v:402:y:2021:i:c:s0096300321001958
    DOI: 10.1016/j.amc.2021.126147
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0096300321001958
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.amc.2021.126147?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. Qingqiong Cai & Xueliang Li & Di Wu, 2017. "Erdős–Gallai-type results for colorful monochromatic connectivity of a graph," Journal of Combinatorial Optimization, Springer, vol. 33(1), pages 123-131, January.
    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. Ping Li & Xueliang Li, 2022. "Monochromatic disconnection: Erdős-Gallai-type problems and product graphs," Journal of Combinatorial Optimization, Springer, vol. 44(1), pages 136-153, August.
    2. Qingqiong Cai & Xueliang Li & Di Wu, 2018. "Some extremal results on the colorful monochromatic vertex-connectivity of a graph," Journal of Combinatorial Optimization, Springer, vol. 35(4), pages 1300-1311, May.

    More about this item

    Keywords

    Coloring; Tree; Connectivity;
    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:402:y:2021:i:c:s0096300321001958. 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.