Extremal stretch of proper-walk coloring of graphs

Zhongmei Qin and Junxue Zhang

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

Abstract: Let G be an edge-colored connected graph, a path (trail, walk) of G is said to be a proper-path (trail, walk) if any two adjacent edges of it are colored distinctly. If there is a proper-path (trail, walk) between each pair of different vertices of G, then G is called proper-path (trail, walk) connected. The edge-coloring which makes G proper-path (trail, walk) connected is called a proper-path (trail, walk) coloring. The minimum number of colors required in a proper-path (trail, walk) coloring is referred to as the proper-path (trail, walk) connection number of G. In J. Bang-Jensen, T. Bellitto and A. Yeo, Proper-walk connection number of graphs, J. Graph Theory 96(2020) 137–159, the authors investigated the graphs with proper-walk connection number k and suggested to study the stretch of proper-walk coloring. In this note, we consider the stretch of proper-walk (path, trail) coloring and present some tight upper bounds.

Keywords: Proper connected coloring; Path; Walk; Trail; Stretch (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/S0096300321003301
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:405:y:2021:i:c:s0096300321003301

DOI: 10.1016/j.amc.2021.126240

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 ().