On s--t paths and trails in edge-colored graphs

DOI10.1016/J.ENDM.2009.11.037MaRDI QIDQ2840541zbMATH OpenOpenAlexFDO

Authors Laurent Gourvès, Adria Lyra, Jérôme Monnot, Fábio Protti, Carlos Martinhon

Publication date 19 July 2013

Published in Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.endm.2009.11.037

zbMATH Keywords

Hamiltonian path problemmonochromatic pathsedge-colored graphsproperly edge-colored pathsEulerian trail problemproperly edge-colored trails

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Coloring of graphs and hypergraphs (05C15) Paths and cycles (05C38)

Recommendations

• On paths, trails and closed trails in edge-colored graphs
• Paths and Trails in Edge-Colored Graphs
• Paths and trails in edge-colored graphs
• Paths and trails in edge-colored weighted graphs
• On \((t-1)\)-colored paths in \(t\)-colored complete graphs
• A generalization of properly colored paths and cycles in edge-colored graphs
• Publication:3470476
• scientific article; zbMATH DE number 762736

Cites work

• scientific article; zbMATH DE number 762736 (Why is no real title available?)
• A note on alternating cycles in edge-coloured graphs
• Alternating Eulerian trails with prescribed degrees in two edge-colored complete graphs
• Alternating cycles and paths in edge-coloured multigraphs: A survey
• Alternating cycles and trails in \(2\)-edge-coloured complete multigraphs
• Alternating paths in edge-colored complete graphs
• DNA physical mapping and alternating Eulerian cycles in colored graphs
• Finding paths in graphs avoiding forbidden transitions
• Hamiltonian problems in edge-colored complete graphs and eulerian cycles in edge-colored graphs : some complexity results
• Monochromatic and heterochromatic subgraphs in edge-colored graphs - A survey
• On monochromatic paths in edge-coloured digraphs
• Paths and trails in edge-colored graphs
• The complexity of finding maximum disjoint paths with length constraints

Cited in

(11)

• Paths and trails in edge-colored graphs
• Complexity of trails, paths and circuits in arc-colored digraphs
• Linear amortized time enumeration algorithms for compatible Euler trails in edge-colored graphs
• On paths, trails and closed trails in edge-colored graphs
• The complexity of routing problems in forbidden-transition graphs and edge-colored graphs
• Paths and trails in edge-colored weighted graphs
• Some conditions for the existence of Euler \(H\)-trails
• scientific article; zbMATH DE number 7765417 (Why is no real title available?)
• Trails in arc-colored digraphs avoiding forbidden transitions
• Paths and Trails in Edge-Colored Graphs
• Acyclicity in edge-colored graphs

This page was built for publication: On \(s\)--\(t\) paths and trails in edge-colored graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2840541)