Proper Hamiltonian Paths in Edge-Colored Multigraphs

dc.creatorÁgueda, Raquel
dc.creatorBorozan, Valentin
dc.creatorGroshaus, Marina Esther
dc.creatorManoussakis, Yannis
dc.creatorMendy, Gervais
dc.creatorMontero, Leandro Pedro
dc.date.accessioned2019-01-21T18:46:43Z
dc.date.accessioned2022-10-14T22:31:12Z
dc.date.available2019-01-21T18:46:43Z
dc.date.available2022-10-14T22:31:12Z
dc.date.created2019-01-21T18:46:43Z
dc.date.issued2011-12
dc.identifierÁgueda, Raquel; Borozan, Valentin; Groshaus, Marina Esther; Manoussakis, Yannis; Mendy, Gervais; et al.; Proper Hamiltonian Paths in Edge-Colored Multigraphs; Elsevier; Electronic Notes in Discrete Mathematics; 38; 12-2011; 5-10
dc.identifier1571-0653
dc.identifierhttp://hdl.handle.net/11336/68315
dc.identifierCONICET Digital
dc.identifierCONICET
dc.identifier.urihttps://repositorioslatinoamericanos.uchile.cl/handle/2250/4314284
dc.description.abstractA c-edge-colored multigraph has each edge colored with one of the c available colors and no two parallel edges have the same color. A proper hamiltonian path is a path containing all the vertices of the multigraph such that no two adjacent edges have the same color. In this work we establish sufficient conditions for a multigraph to have a proper hamiltonian path, depending on several parameters such as the number of edges, the rainbow degree, etc.
dc.languageeng
dc.publisherElsevier
dc.relationinfo:eu-repo/semantics/altIdentifier/doi/http://dx.doi.org/10.1016/j.endm.2011.09.002
dc.relationinfo:eu-repo/semantics/altIdentifier/url/https://www.sciencedirect.com/science/article/pii/S1571065311000710
dc.rightshttps://creativecommons.org/licenses/by-nc-nd/2.5/ar/
dc.rightsinfo:eu-repo/semantics/restrictedAccess
dc.subjectEDGE-COLORING
dc.subjectMULTIGRAPH
dc.subjectPROPER HAMILTONIAN PATH
dc.titleProper Hamiltonian Paths in Edge-Colored Multigraphs
dc.typeinfo:eu-repo/semantics/article
dc.typeinfo:ar-repo/semantics/artículo
dc.typeinfo:eu-repo/semantics/publishedVersion


Este ítem pertenece a la siguiente institución