Trails in arc-colored digraphs avoiding forbidden transitions

DOI10.47443/DML.2023.190MaRDI QIDQ6561576zbMATH OpenFDO

Authors Carlos Vilchis-Alfaro, Hortensia Galeana-Sánchez

Publication date 25 June 2024

Published in DML. Discrete Mathematics Letters (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

zbMATH Keywords

polynomial algorithmsarc-colored digrapharc-colored trails

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Coloring of graphs and hypergraphs (05C15)

Recommendations

• Complexity of Paths, Trails and Circuits in Arc-Colored Digraphs
• Complexity of trails, paths and circuits in arc-colored digraphs
• On \(s\)--\(t\) paths and trails in edge-colored graphs
• Paths and trails in edge-colored graphs
• Paths and Trails in Edge-Colored Graphs

Cites work

• scientific article; zbMATH DE number 1153462 (Why is no real title available?)
• scientific article; zbMATH DE number 762736 (Why is no real title available?)
• Almost Eulerian compatible spanning circuits in edge-colored graphs
• Compatible spanning circuits in edge-colored graphs
• Complexity of trails, paths and circuits in arc-colored digraphs
• Digraphs
• Finding paths in graphs avoiding forbidden transitions
• Hamiltonian circuits determining the order of chromosomes
• Independent restricted domination and the line digraph
• On minimum connecting transition sets in graphs
• On supereulerian 2-edge-coloured graphs
• Paths and trails in edge-colored graphs
• Properly colored paths and cycles
• Restricted domination in arc-colored digraphs
• Some conditions for the existence of Euler \(H\)-trails
• The complexity of routing problems in forbidden-transition graphs and edge-colored graphs
• \(H\)-cycles in \(H\)-colored multigraphs
• \(H\)-kernels in infinite digraphs

This page was built for publication: Trails in arc-colored digraphs avoiding forbidden transitions

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