Multicolorful connectivity of trees

Zemin Jin, Xueyao Gui and Kaijun Wang

Applied Mathematics and Computation, 2021, vol. 402, issue C

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.

Keywords: Coloring; Tree; Connectivity (search for similar items in EconPapers)
Date: 2021
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0096300321001958
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:apmaco:v:402:y:2021:i:c:s0096300321001958

DOI: 10.1016/j.amc.2021.126147

Access Statistics for this article

Applied Mathematics and Computation is currently edited by Theodore Simos

More articles in Applied Mathematics and Computation from Elsevier
Bibliographic data for series maintained by Catherine Liu ().