Mostrar el registro sencillo del ítem

dc.contributor.author
Águeda, Raquel  
dc.contributor.author
Borozan, Valentin  
dc.contributor.author
Groshaus, Marina Esther  
dc.contributor.author
Manoussakis, Yannis  
dc.contributor.author
Mendy, Gervais  
dc.contributor.author
Montero, Leandro  
dc.date.available
2022-07-26T19:27:06Z  
dc.date.issued
2017-07  
dc.identifier.citation
Águeda, Raquel; Borozan, Valentin; Groshaus, Marina Esther; Manoussakis, Yannis; Mendy, Gervais; et al.; Proper hamiltonian paths in edge-coloured multigraphs; Springer Tokyo; Graphs And Combinatorics; 33; 4; 7-2017; 617-633  
dc.identifier.issn
0911-0119  
dc.identifier.uri
http://hdl.handle.net/11336/163203  
dc.description.abstract
Given a c-edge-coloured multigraph, where c is a positive integer, a proper Hamiltonian path is a path that contains all the vertices of the multigraph such that no two adjacent edges have the same colour. In this work we establish sufficient conditions for an edge-coloured multigraph to guarantee the existence of a proper Hamiltonian path, involving various parameters such as the number of edges, the number of colours, the rainbow degree and the connectivity.  
dc.format
application/pdf  
dc.language.iso
eng  
dc.publisher
Springer Tokyo  
dc.rights
info:eu-repo/semantics/openAccess  
dc.rights.uri
https://creativecommons.org/licenses/by-nc-sa/2.5/ar/  
dc.subject
EDGE-COLOURED GRAPH  
dc.subject
MULTIGRAPH  
dc.subject
PROPER HAMILTONIAN PATH  
dc.subject.classification
Ciencias de la Computación  
dc.subject.classification
Ciencias de la Computación e Información  
dc.subject.classification
CIENCIAS NATURALES Y EXACTAS  
dc.title
Proper hamiltonian paths in edge-coloured multigraphs  
dc.type
info:eu-repo/semantics/article  
dc.type
info:ar-repo/semantics/artículo  
dc.type
info:eu-repo/semantics/publishedVersion  
dc.date.updated
2022-07-25T15:22:17Z  
dc.journal.volume
33  
dc.journal.number
4  
dc.journal.pagination
617-633  
dc.journal.pais
Japón  
dc.journal.ciudad
Tokyo  
dc.description.fil
Fil: Águeda, Raquel. Universidad de Castilla-La Mancha; España  
dc.description.fil
Fil: Borozan, Valentin. Université Paris Sud; Francia  
dc.description.fil
Fil: Groshaus, Marina Esther. Consejo Nacional de Investigaciones Científicas y Técnicas. Oficina de Coordinación Administrativa Ciudad Universitaria; Argentina. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales. Departamento de Computación; Argentina  
dc.description.fil
Fil: Manoussakis, Yannis. Université Paris Sud; Francia  
dc.description.fil
Fil: Mendy, Gervais. Université Paris Sud; Francia  
dc.description.fil
Fil: Montero, Leandro. Université Paris Sud; Francia  
dc.journal.title
Graphs And Combinatorics  
dc.relation.alternativeid
info:eu-repo/semantics/altIdentifier/url/https://link.springer.com/article/10.1007/s00373-017-1803-6  
dc.relation.alternativeid
info:eu-repo/semantics/altIdentifier/doi/http://dx.doi.org/10.1007/s00373-017-1803-6  

Archivos asociados
Thumbnail
 
Tamaño: 470.6Kb
Formato: PDF
.