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

Erdős–Gallai-type results for colorful monochromatic connectivity of a graph

Author

Listed:
  • Qingqiong Cai

    (Nankai University)

  • Xueliang Li

    (Nankai University)

  • Di Wu

    (Nankai University)

Abstract

A path in an edge-colored graph is called a monochromatic path if all the edges on the path are colored with one same color. An edge-coloring of G is a monochromatic connection coloring (MC-coloring, for short) if there is a monochromatic path joining any two vertices in G. For a connected graph G, the monochromatic connection number of G, denoted by mc(G), is defined to be the maximum number of colors used in an MC-coloring of G. These concepts were introduced by Caro and Yuster, and they got some nice results. In this paper, we study two kinds of Erdős–Gallai-type problems for mc(G), and completely solve them.

Suggested Citation

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

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10878-015-9938-y
    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-9938-y?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.

    Citations

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


    Cited by:

    1. Jin, Zemin & Gui, Xueyao & Wang, Kaijun, 2021. "Multicolorful connectivity of trees," Applied Mathematics and Computation, Elsevier, vol. 402(C).
    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.
    3. 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.

    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-9938-y. 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.

    We have no bibliographic references for this item. You can help adding them by using 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.