Navegar

Colección

Datos Estadísticas

Artículo

Águeda, R.; Borozan, V.; Groshaus, M.; Manoussakis, Y.; Mendy, G.; Montero, L. "Proper Hamiltonian Paths in Edge-Colored Multigraphs" (2011) Electronic Notes in Discrete Mathematics. 38:5-10
La versión final de este artículo es de uso interno. El editor solo permite incluir en el repositorio el artículo en su versión post-print. Por favor, si usted la posee enviela a
Consulte el artículo en la página del editor
Consulte la política de Acceso Abierto del editor

Abstract:

A 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. © 2011 Elsevier B.V.

Registro:

Documento: Artículo
Título:Proper Hamiltonian Paths in Edge-Colored Multigraphs
Autor:Águeda, R.; Borozan, V.; Groshaus, M.; Manoussakis, Y.; Mendy, G.; Montero, L.
Filiación:Universidad de Castilla, La Mancha, 45071 Toledo, Spain
L.R.I., University Paris 11 Sud, Bât. 490, 91405 Orsay Cedex, France
Departamento de Computación, FCEyN, Universidad de Buenos Aires, Buenos Aires, Argentina
Palabras clave:Edge-Coloring; Multigraph; Proper Hamiltonian Path
Año:2011
Volumen:38
Página de inicio:5
Página de fin:10
DOI: http://dx.doi.org/10.1016/j.endm.2011.09.002
Título revista:Electronic Notes in Discrete Mathematics
Título revista abreviado:Electron. Notes Discrete Math.
ISSN:15710653
Registro:https://bibliotecadigital.exactas.uba.ar/collection/paper/document/paper_15710653_v38_n_p5_Agueda

Referencias:

  • Abouelaoualim, A., Das, K.C., de la Vega, W.F., Karpinski, M., Manoussakis, Y., Martinhon, C.A., Saad, R., Cycles and paths in edge-colored graphs with given degrees (2010) J. Graph Theory, 64, pp. 63-86
  • Bang-Jensen, J., Gutin, G., Alternating cycles and paths in edge-coloured multigraphs: A survey (1997) Discrete Math., pp. 39-60
  • Bang-Jensen, J., Gutin, G., (2001) Digraphs, , Springer-Verlag, London Ltd
  • Benkouar, A., Manoussakis, Y., Paschos, V.T., Saad, R., Hamiltonian problems in edge-colored complete graphs and Eulerian cycles in edge-colored graphs: Some complexity results (1996) RAIRO Rech. Opér., 30, pp. 417-438
  • Feng, J., Giesen, H.-E., Guo, Y., Gutin, G., Jensen, T., Rafiey, A., Characterization of edge-colored complete graphs with properly colored Hamilton paths (2006) J. Graph Theory, 53, pp. 333-346
  • Gutin, G., Kim, E., Properly coloured cycles and paths: Results and open problems (2009) Graph theory, computational intelligence and thought, , Springer
  • Hu, T.C., Kuo, Y.S., Graph folding and programmable logic array (1987) Networks, 17, pp. 19-37
  • Pevzner, P.A., (2000) Computational molecular biology, , MIT Press

Citas:

---------- APA ----------
Águeda, R., Borozan, V., Groshaus, M., Manoussakis, Y., Mendy, G. & Montero, L. (2011) . Proper Hamiltonian Paths in Edge-Colored Multigraphs. Electronic Notes in Discrete Mathematics, 38, 5-10.
http://dx.doi.org/10.1016/j.endm.2011.09.002
---------- CHICAGO ----------
Águeda, R., Borozan, V., Groshaus, M., Manoussakis, Y., Mendy, G., Montero, L. "Proper Hamiltonian Paths in Edge-Colored Multigraphs" . Electronic Notes in Discrete Mathematics 38 (2011) : 5-10.
http://dx.doi.org/10.1016/j.endm.2011.09.002
---------- MLA ----------
Águeda, R., Borozan, V., Groshaus, M., Manoussakis, Y., Mendy, G., Montero, L. "Proper Hamiltonian Paths in Edge-Colored Multigraphs" . Electronic Notes in Discrete Mathematics, vol. 38, 2011, pp. 5-10.
http://dx.doi.org/10.1016/j.endm.2011.09.002
---------- VANCOUVER ----------
Águeda, R., Borozan, V., Groshaus, M., Manoussakis, Y., Mendy, G., Montero, L. Proper Hamiltonian Paths in Edge-Colored Multigraphs. Electron. Notes Discrete Math. 2011;38:5-10.
http://dx.doi.org/10.1016/j.endm.2011.09.002