Pages that link to "Item:Q1928492"
From MaRDI portal
The following pages link to On the complexity of path problems in properly colored directed graphs (Q1928492):
Displaying 6 items.
- Multicolour paths in graphs: NP-hardness, algorithms, and applications on routing in WDM networks (Q511728) (← links)
- A note on the complexity of longest path problems related to graph coloring (Q1433224) (← links)
- Maximum colorful cycles in vertex-colored graphs (Q1625149) (← links)
- The complexity of routing problems in forbidden-transition graphs and edge-colored graphs (Q2701383) (← links)
- Finding Paths between Graph Colourings: Computational Complexity and Possible Distances (Q3503504) (← links)
- The Orderly Colored Longest Path Problem – a survey of applications and new algorithms (Q5410241) (← links)