Pages that link to "Item:Q1861577"
From MaRDI portal
The following pages link to Finding paths in graphs avoiding forbidden transitions (Q1861577):
Displaying 31 items.
- Finding a contra-risk path between two nodes in undirected graphs (Q326494) (← links)
- Odd properly colored cycles in edge-colored graphs (Q507513) (← links)
- On paths avoding forbidden pairs of vertices in a graph (Q678872) (← links)
- Two-factors in orientated graphs with forbidden transitions (Q998498) (← links)
- On minimum connecting transition sets in graphs (Q1627151) (← links)
- Separating codes and traffic monitoring (Q1704860) (← links)
- The complexity landscape of decompositional parameters for ILP (Q1749387) (← links)
- Analyzing the reachability problem in choice networks (Q2170221) (← links)
- Codon optimization by 0-1 linear programming (Q2177826) (← links)
- Avoidable paths in graphs (Q2215468) (← links)
- Paths and trails in edge-colored weighted graphs (Q2333812) (← links)
- Finding disjoint paths in networks with star shared risk link groups (Q2344758) (← links)
- Paths and trails in edge-colored graphs (Q2378531) (← links)
- On edge-colored graphs covered by properly colored cycles (Q2573800) (← 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)
- On \(s\)--\(t\) paths and trails in edge-colored graphs (Q2840541) (← links)
- Some Hamiltonian Properties of One-Conflict Graphs (Q2946062) (← links)
- Properly Coloured Cycles and Paths: Results and Open Problems (Q3655153) (← links)
- Trees in Graphs with Conflict Edges or Forbidden Transitions (Q4922140) (← links)
- (Q4993356) (← links)
- Simple Paths and Cycles Avoiding Forbidden Paths (Q5127183) (← links)
- Shortest paths avoiding forbidden subpaths (Q5326797) (← links)
- Shortest Paths Avoiding Forbidden Subpaths (Q5389966) (← links)
- Paths and Trails in Edge-Colored Graphs (Q5458574) (← links)
- Fractional cycle decompositions in hypergraphs (Q6052479) (← links)
- (Q6065468) (← links)
- Reachability in choice networks (Q6108917) (← links)
- Trails in arc-colored digraphs avoiding forbidden transitions (Q6561576) (← links)
- On the routing problems in graphs with ordered forbidden transitions (Q6591488) (← links)
- The fine-grained complexity of approximately counting proper connected colorings (extended abstract) (Q6606223) (← links)
