Properly Coloured Cycles and Paths: Results and Open Problems
| dc.creator | Gutin, Gregory | |
| dc.creator | Kim, Eun Jung | |
| dc.date | 2008-05-26 | |
| dc.date | 2008-05-31 | |
| dc.date.accessioned | 2026-07-07T09:41:41Z | |
| dc.date.available | 2026-07-07T09:41:41Z | |
| dc.description | 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. | |
| dc.identifier | https://arxiv.org/abs/0805.3901 | |
| dc.identifier | http://arxiv.org/abs/0805.3901 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/161914 | |
| dc.subject | Discrete Mathematics | |
| dc.subject | Data Structures and Algorithms | |
| dc.title | Properly Coloured Cycles and Paths: Results and Open Problems | |
| dc.type | text |