Properly Coloured Cycles and Paths: Results and Open Problems

Details Properly Coloured Cycles and Paths: Results and Open Problems Properly Coloured Cycles and Paths: Results and Open Problems

2008-05-26

arxiv.org/abs/0805.3901v3

Computer Science

Discrete Mathematics

Scientific paper

In this paper, we consider a number of results and seven conjectures on properly edge-coloured (PC) paths and cycles in edge-coloured multigraphs. We overview some known results and prove new ones. In particular, we consider a family of transformations of an edge-coloured multigraph $G$ into an ordinary graph that allow us to check the existence PC cycles and PC $(s,t)$-paths in $G$ and, if they exist, to find shortest ones among them. We raise a problem of finding the optimal transformation and consider a possible solution to the problem.

Affiliated with

Also associated with

No associations

Rating

Properly Coloured Cycles and Paths: Results and Open Problems does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Properly Coloured Cycles and Paths: Results and Open Problems, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Properly Coloured Cycles and Paths: Results and Open Problems will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-321015