Proper Hamiltonian Paths in Edge-Colored Multigraphs
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 suffici...
Guardado en:
| Autor principal: | |
|---|---|
| Otros Autores: | , , , , |
| Formato: | Capítulo de libro |
| Lenguaje: | Inglés |
| Publicado: |
2011
|
| Acceso en línea: | Registro en Scopus DOI Handle Registro en la Biblioteca Digital |
| Aporte de: | Registro referencial: Solicitar el recurso aquí |
| LEADER | 04050caa a22005537a 4500 | ||
|---|---|---|---|
| 001 | PAPER-10109 | ||
| 003 | AR-BaUEN | ||
| 005 | 20230518204007.0 | ||
| 008 | 190411s2011 xx ||||fo|||| 00| 0 eng|d | ||
| 024 | 7 | |2 scopus |a 2-s2.0-82955192600 | |
| 040 | |a Scopus |b spa |c AR-BaUEN |d AR-BaUEN | ||
| 100 | 1 | |a Águeda, R. | |
| 245 | 1 | 0 | |a Proper Hamiltonian Paths in Edge-Colored Multigraphs |
| 260 | |c 2011 | ||
| 270 | 1 | 0 | |m Águeda, R.; Universidad de Castilla, La Mancha, 45071 Toledo, Spain; email: raquel.agueda@uclm.es |
| 506 | |2 openaire |e Política editorial | ||
| 504 | |a 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 | ||
| 504 | |a Bang-Jensen, J., Gutin, G., Alternating cycles and paths in edge-coloured multigraphs: A survey (1997) Discrete Math., pp. 39-60 | ||
| 504 | |a Bang-Jensen, J., Gutin, G., (2001) Digraphs, , Springer-Verlag, London Ltd | ||
| 504 | |a 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 | ||
| 504 | |a 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 | ||
| 504 | |a Gutin, G., Kim, E., Properly coloured cycles and paths: Results and open problems (2009) Graph theory, computational intelligence and thought, , Springer | ||
| 504 | |a Hu, T.C., Kuo, Y.S., Graph folding and programmable logic array (1987) Networks, 17, pp. 19-37 | ||
| 504 | |a Pevzner, P.A., (2000) Computational molecular biology, , MIT Press | ||
| 520 | 3 | |a 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. |l eng | |
| 536 | |a Detalles de la financiación: PICT 1562 | ||
| 536 | |a Detalles de la financiación: Secretaría de Ciencia y Técnica, Universidad de Buenos Aires, X456, X143 | ||
| 536 | |a Detalles de la financiación: Consejo Nacional de Investigaciones Científicas y Técnicas | ||
| 536 | |a Detalles de la financiación: Partially supported by UBACyT X456, X143 and ANPCyT PICT 1562 Grants and by CONICET, Argentina. | ||
| 593 | |a Universidad de Castilla, La Mancha, 45071 Toledo, Spain | ||
| 593 | |a L.R.I., University Paris 11 Sud, Bât. 490, 91405 Orsay Cedex, France | ||
| 593 | |a Departamento de Computación, FCEyN, Universidad de Buenos Aires, Buenos Aires, Argentina | ||
| 690 | 1 | 0 | |a EDGE-COLORING |
| 690 | 1 | 0 | |a MULTIGRAPH |
| 690 | 1 | 0 | |a PROPER HAMILTONIAN PATH |
| 700 | 1 | |a Borozan, V. | |
| 700 | 1 | |a Groshaus, M. | |
| 700 | 1 | |a Manoussakis, Y. | |
| 700 | 1 | |a Mendy, G. | |
| 700 | 1 | |a Montero, L. | |
| 773 | 0 | |d 2011 |g v. 38 |h pp. 5-10 |p Electron. Notes Discrete Math. |x 15710653 |t Electronic Notes in Discrete Mathematics | |
| 856 | 4 | 1 | |u https://www.scopus.com/inward/record.uri?eid=2-s2.0-82955192600&doi=10.1016%2fj.endm.2011.09.002&partnerID=40&md5=490fe0b7d3b858c903c3bcdef3164bc5 |y Registro en Scopus |
| 856 | 4 | 0 | |u https://doi.org/10.1016/j.endm.2011.09.002 |y DOI |
| 856 | 4 | 0 | |u https://hdl.handle.net/20.500.12110/paper_15710653_v38_n_p5_Agueda |y Handle |
| 856 | 4 | 0 | |u https://bibliotecadigital.exactas.uba.ar/collection/paper/document/paper_15710653_v38_n_p5_Agueda |y Registro en la Biblioteca Digital |
| 961 | |a paper_15710653_v38_n_p5_Agueda |b paper |c PE | ||
| 962 | |a info:eu-repo/semantics/article |a info:ar-repo/semantics/artículo |b info:eu-repo/semantics/publishedVersion | ||
| 963 | |a VARI | ||
| 999 | |c 71062 | ||