Trails in arc-colored digraphs avoiding forbidden transitions
DOI10.47443/DML.2023.190MaRDI QIDQ6561576FDOQ6561576
Authors: Carlos Vilchis-Alfaro, Hortensia Galeana-Sánchez 
Publication date: 25 June 2024
Published in: DML. Discrete Mathematics Letters (Search for Journal in Brave)
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)
Cites Work
- Digraphs
- Restricted domination in arc-colored digraphs
- \(H\)-kernels in infinite digraphs
- Title not available (Why is that?)
- Finding paths in graphs avoiding forbidden transitions
- Properly colored paths and cycles
- Complexity of trails, paths and circuits in arc-colored digraphs
- Paths and trails in edge-colored graphs
- Title not available (Why is that?)
- Hamiltonian circuits determining the order of chromosomes
- Compatible spanning circuits in edge-colored graphs
- On minimum connecting transition sets in graphs
- Independent restricted domination and the line digraph
- Almost Eulerian compatible spanning circuits in edge-colored graphs
- On supereulerian 2-edge-coloured graphs
- \(H\)-cycles in \(H\)-colored multigraphs
- Some conditions for the existence of Euler \(H\)-trails
- The complexity of routing problems in forbidden-transition graphs and edge-colored graphs
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)
