Pages that link to "Item:Q1946225"
From MaRDI portal
The following pages link to Complexity of trails, paths and circuits in arc-colored digraphs (Q1946225):
Displaying 9 items.
- The edge-recoloring cost of monochromatic and properly edge-colored paths and cycles (Q497683) (← links)
- On the complexity of path problems in properly colored directed graphs (Q1928492) (← links)
- Paths and trails in edge-colored weighted graphs (Q2333812) (← links)
- The complexity of routing problems in forbidden-transition graphs and edge-colored graphs (Q2701383) (← links)
- Finding Paths in Grids with Forbidden Transitions (Q2827809) (← links)
- Complexity of Paths, Trails and Circuits in Arc-Colored Digraphs (Q3569078) (← links)
- (Q6065468) (← links)
- A System of Interaction and Structure III: The Complexity of BV and Pomset Logic (Q6137849) (← links)
- Trails in arc-colored digraphs avoiding forbidden transitions (Q6561576) (← links)