Proper-walk connection of hamiltonian digraphs

Zhenzhen Li and Baoyindureng Wu

Applied Mathematics and Computation, 2022, vol. 427, issue C

Abstract: Under an arc-coloring c of a digraph D, if for each pair of vertices (u,v), there exists a directed walk from u to v satisfying that any two consecutive arcs of it have different colors, we say that D is properly-walk connected, and c is a proper-walk coloring of D. The proper-walk connection number wc→(D) of D is the least integer k such that D has a proper-walk coloring with k colors.

Keywords: Proper-walk connection; Hamiltonian digraph (search for similar items in EconPapers)
Date: 2022
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0096300322002442
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:427:y:2022:i:c:s0096300322002442

DOI: 10.1016/j.amc.2022.127169

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