Rainbow eulerian multidigraphs and the product of cycles

Document typeArticle
Defense date2016-01-01
Rights accessOpen Access
Abstract
An arc colored eulerian multidigraph with l colors is rainbow eulerian if there is an
eulerian circuit in which a sequence of l colors repeats. The digraph product that refers the title was introduced by Figueroa-Centeno et al. as follows: let D be a digraph and let G be a family of digraphs such that V (F) = V for every F ¿ G
CitationLópez, S.C., Muntaner-Batle, F.A. Rainbow eulerian multidigraphs and the product of cycles. "Discrete mathematics and theoretical computer science", 1 Gener 2016, vol. 17, núm. 3, p. 91-104.
ISSN1365-8050
Publisher versionhttp://dmtcs.episciences.org/2153
Files | Description | Size | Format | View |
---|---|---|---|---|
RainbEulMultiDig_v12.pdf | Article Principal | 237,7Kb | View/Open | |
Rainbow.pdf | 237,7Kb | View/Open |
Except where otherwise noted, content on this work
is licensed under a Creative Commons license
:
Attribution-NonCommercial-NoDerivs 3.0 Spain