Carlos A. Martinhon

Paths and trails in edge-colored graphs

A. Abouelaoualim, Kinkar Chandra Das, Luérbio Faria et al. · Theoretical Computer Science · 2008 · 43 citations

Graph Theory, Extremal Graph Theory, Structural Graph Theory +6

Stronger K-tree relaxations for the vehicle routing problem

Carlos A. Martinhon, Abílio Lucena, Nelson Maculan · European Journal of Operational Research · 2003 · 32 citations

Mathematical Programming, Vehicle Routing, Stronger K-tree Relaxations +9

The minimum reload <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si46.gif" display="inline" overflow="scroll"><mml:mi>s</mml:mi></mml:math>–<mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si47.gif" display="inline" overflow="scroll"><mml:mi>t</mml:mi></mml:math> path, trail and walk problems

Laurent Gourvès, Adria Lyra, Carlos A. Martinhon et al. · Discrete Applied Mathematics · 2010 · 31 citations

Math Xmlns, Computer Science, Walk Problems

Cycles and paths in edge‐colored graphs with given degrees

A. Abouelaoualim, Kinkar Chandra Das, W. Fernandez de la Véga et al. · Journal of Graph Theory · 2009 · 22 citations

Edge‐colored Graphs, Geometric Graph Theory, Graph Theory +7

Complexity of trails, paths and circuits in arc-colored digraphs

Laurent Gourvès, Adria Lyra, Carlos A. Martinhon et al. · Discrete Applied Mathematics · 2012 · 19 citations

Arc-colored Digraphs, Directed Graph, Engineering +7