Hamiltonian problems in edge-colored complete graphs and eulerian cycles in edge-colored graphs : some complexity results
RAIRO-Oper. Res., 30 4 (1996) 417-438
Published online: 2017-02-10
Articles citing this article
The Citing articles tool gives a list of articles citing the current article.
The citing articles come from EDP Sciences database, as well as other publishers participating in CrossRef Cited-by Linking Program. You can set up your personal account to receive an email alert each time this article is cited by a new article (see the menu on the right-hand side of the abstract page).
Cited article:
This article has been cited by the following article(s):
Parallel Connectivity in Edge-Colored Complete Graphs: Complexity Results
Rachid SaadGraphs and Combinatorics 40 (2) (2024)
https://doi.org/10.1007/s00373-023-02747-4
Compatible Spanning Circuits and Forbidden Induced Subgraphs
Zhiwei Guo, Christoph Brause, Maximilian Geißer and Ingo SchiermeyerGraphs and Combinatorics 40 (1) (2024)
https://doi.org/10.1007/s00373-023-02735-8
Linear amortized time enumeration algorithms for compatible Euler trails in edge-colored graphs
Yuhang Bai, Zhiwei Guo, Shenggui Zhang and Yandong BaiJournal of Combinatorial Optimization 45 (2) (2023)
https://doi.org/10.1007/s10878-023-01005-w
Almost eulerian compatible spanning circuits in edge-colored graphs
Zhiwei Guo, Hajo Broersma, Binlong Li and Shenggui ZhangDiscrete Mathematics 344 (1) 112174 (2021)
https://doi.org/10.1016/j.disc.2020.112174
A reduction heuristic for the all-colors shortest path problem
Francesco Carrabs, Raffaele Cerulli and Andrea RaiconiRAIRO - Operations Research 55 S2071 (2021)
https://doi.org/10.1051/ro/2020078
Some algorithmic results for finding compatible spanning circuits in edge-colored graphs
Zhiwei Guo, Hajo Broersma, Ruonan Li and Shenggui ZhangJournal of Combinatorial Optimization 40 (4) 1008 (2020)
https://doi.org/10.1007/s10878-020-00644-7
Maximum colored trees in edge-colored graphs
V. Borozan, W. Fernandez de La Vega, Y. Manoussakis, C. Martinhon, R. Muthu, H.P. Pham and R. SaadEuropean Journal of Combinatorics 80 296 (2019)
https://doi.org/10.1016/j.ejc.2018.02.027
Compatible Eulerian circuits in Eulerian (di)graphs with generalized transition systems
Zhiwei Guo, Xueliang Li, Chuandong Xu and Shenggui ZhangDiscrete Mathematics 341 (7) 2104 (2018)
https://doi.org/10.1016/j.disc.2018.04.014
Proper Hamiltonian cycles in edge-colored multigraphs
Raquel Águeda, Valentin Borozan, Raquel Díaz, Yannis Manoussakis and Leandro MonteroDiscrete Mathematics 340 (8) 1897 (2017)
https://doi.org/10.1016/j.disc.2017.03.013
Proper Hamiltonian Paths in Edge-Coloured Multigraphs
Raquel Águeda, Valentin Borozan, Marina Groshaus, et al.Graphs and Combinatorics 33 (4) 617 (2017)
https://doi.org/10.1007/s00373-017-1803-6
Complexity of trails, paths and circuits in arc-colored digraphs
Laurent Gourvès, Adria Lyra, Carlos A. Martinhon and Jérôme MonnotDiscrete Applied Mathematics 161 (6) 819 (2013)
https://doi.org/10.1016/j.dam.2012.10.025
Eulerian Circuits with No Monochromatic Transitions in Edge-colored Digraphs
James M. Carraher and Stephen G. HartkeSIAM Journal on Discrete Mathematics 27 (4) 1924 (2013)
https://doi.org/10.1137/120878732
Proper Hamiltonian Paths in Edge-Colored Multigraphs
Raquel Águeda, Valentin Borozan, Marina Groshaus, et al.Electronic Notes in Discrete Mathematics 38 5 (2011)
https://doi.org/10.1016/j.endm.2011.09.002
Links in edge-colored graphs
J.M. Becu, M. Dah, Y. Manoussakis and G. MendyEuropean Journal of Combinatorics 31 (2) 442 (2010)
https://doi.org/10.1016/j.ejc.2009.03.021
Problems from CGCS Luminy, May 2007
Peter J. CameronEuropean Journal of Combinatorics 31 (2) 644 (2010)
https://doi.org/10.1016/j.ejc.2009.03.045
Theory and Applications of Models of Computation
Laurent Gourvès, Adria Lyra, Carlos Martinhon and Jérôme MonnotLecture Notes in Computer Science, Theory and Applications of Models of Computation 6108 222 (2010)
https://doi.org/10.1007/978-3-642-13562-0_21
Cycles and paths in edge‐colored graphs with given degrees
A. Abouelaoualim,, K. Ch. Das, W. Fernandez de la Vega, M. Karpinski, Y. Manoussakis, C. A. Martinhon and R. SaadJournal of Graph Theory 64 (1) 63 (2010)
https://doi.org/10.1002/jgt.20440
LATIN 2008: Theoretical Informatics
A. Abouelaoualim, K. Ch. Das, L. Faria, et al.Lecture Notes in Computer Science, LATIN 2008: Theoretical Informatics 4957 723 (2008)
https://doi.org/10.1007/978-3-540-78773-0_62
Paths and trails in edge-colored graphs
A. Abouelaoualim, K.Ch. Das, L. Faria, Y. Manoussakis, C. Martinhon and R. SaadTheoretical Computer Science 409 (3) 497 (2008)
https://doi.org/10.1016/j.tcs.2008.09.021