Properly colored trails, paths, and bridges

Wayne Goddard () and Robert Melville
Additional contact information
Wayne Goddard: Clemson University
Robert Melville: Clemson University

Journal of Combinatorial Optimization, 2018, vol. 35, issue 2, No 11, 463-472

Abstract: Abstract The proper-trail connection number of a graph is the minimum number of colors needed to color the edges such that every pair of vertices are joined by a trail without two consecutive edges of the same color; the proper-path connection number is defined similarly. In this paper we consider these in both bridgeless graphs and graphs in general. The main result is that both parameters are tied to the maximum number of bridges incident with a vertex. In particular, we provide for $$k\ge 4$$ k ≥ 4 a simple characterization of graphs with proper-trail connection number k, and show that the proper-path connection number can be approximated in polynomial-time within an additive 2.

Keywords: Edge coloring; Properly colored trails; Path connection number; Bridges (search for similar items in EconPapers)
Date: 2018
References: View complete reference list from CitEc
Citations: View citations in EconPapers (3)

Downloads: (external link)
http://link.springer.com/10.1007/s10878-017-0191-4 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

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:spr:jcomop:v:35:y:2018:i:2:d:10.1007_s10878-017-0191-4

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1007/s10878-017-0191-4

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().