Pages that link to "Item:Q2378531"
From MaRDI portal
The following pages link to Paths and trails in edge-colored graphs (Q2378531):
Displaying 28 items.
- On the maximum disjoint paths problem on edge-colored graphs (Q435732) (← links)
- The edge-recoloring cost of monochromatic and properly edge-colored paths and cycles (Q497683) (← links)
- Paths through K-specified edges in a linear graph (Q690196) (← links)
- The minimum reload \(s-t\) path, trail and walk problems (Q987690) (← links)
- Using matrices to link conflict evolution and resolution in a graph model (Q992610) (← links)
- Finding disjoint paths on edge-colored graphs: more tractability results (Q1631683) (← links)
- Maximum disjoint paths on edge-colored graphs: approximability and tractability (Q1736537) (← links)
- On the complexity of path problems in properly colored directed graphs (Q1928492) (← links)
- Complexity of trails, paths and circuits in arc-colored digraphs (Q1946225) (← links)
- A new sufficient condition for the existence of alternating Hamiltonian cycles in 2-edge-colored multigraphs (Q2012053) (← links)
- Theory and implementation of coalitional analysis in cooperative decision making (Q2015030) (← links)
- Nonlinear large deviations: beyond the hypercube (Q2192741) (← links)
- Optimal pathway reconstruction on 3D NMR maps (Q2255053) (← links)
- Maximum colored trees in edge-colored graphs (Q2311375) (← links)
- Paths and trails in edge-colored weighted graphs (Q2333812) (← links)
- Some conditions for the existence of Euler \(H\)-trails (Q2334082) (← links)
- Acyclicity in edge-colored graphs (Q2374151) (← links)
- Proper vertex-pancyclicity of edge-colored complete graphs without joint monochromatic triangles (Q2656965) (← links)
- The complexity of routing problems in forbidden-transition graphs and edge-colored graphs (Q2701383) (← links)
- On \(s\)--\(t\) paths and trails in edge-colored graphs (Q2840541) (← links)
- Acyclic Digraphs (Q3120435) (← links)
- Complexity of Paths, Trails and Circuits in Arc-Colored Digraphs (Q3569078) (← links)
- The Minimum Reload s-t Path/Trail/Walk Problems (Q3599109) (← links)
- (Q4836076) (← links)
- (Q6065468) (← links)
- Parallel connectivity in edge-colored complete graphs: complexity results (Q6154375) (← links)
- Trails in arc-colored digraphs avoiding forbidden transitions (Q6561576) (← links)
- The fine-grained complexity of approximately counting proper connected colorings (extended abstract) (Q6606223) (← links)