scientific article; zbMATH DE number 6273752

zbMath1283.05097MaRDI QIDQ5403027

Adria Lyra, Jérôme Monnot, Laurent Gourvès, Carlos A. Martinhon

Publication date: 25 March 2014

Full work available at URL: https://www.dmtcs.org/dmtcs-ojs/index.php/dmtcs/article/view/2078/0.html

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

monochromatic pathsedge-colored graphsproperly edge-colored closed trails and cyclesproperly edge-colored paths and trails

Mathematics Subject Classification ID

Paths and cycles (05C38) Coloring of graphs and hypergraphs (05C15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (3)

Finding disjoint paths on edge-colored graphs: more tractability results ⋮ The edge-recoloring cost of monochromatic and properly edge-colored paths and cycles ⋮ Optimal pathway reconstruction on 3D NMR maps

This page was built for publication: