Pages that link to "Item:Q678872"
From MaRDI portal
The following pages link to On paths avoding forbidden pairs of vertices in a graph (Q678872):
Displaying 15 items.
- On the path avoiding forbidden pairs polytope (Q324839) (← links)
- The checkpoint problem (Q714790) (← links)
- On legal path problems in digraphs (Q790621) (← links)
- On the complexity of paths avoiding forbidden pairs (Q967328) (← links)
- Domination problems with no conflicts (Q1752590) (← links)
- On vertex-degree restricted paths in polyhedral graphs (Q1970577) (← links)
- Characterizing forbidden pairs for relative length of longest paths and cycles (Q2138962) (← links)
- Analyzing the reachability problem in choice networks (Q2170221) (← links)
- Sorting with forbidden intermediates (Q2181215) (← links)
- Complexity of the path avoiding forbidden pairs problem revisited (Q2446333) (← links)
- Path problems in skew-symmetric graphs (Q2563512) (← links)
- Constrained hitting set problem with intervals (Q2695330) (← links)
- Reachability in choice networks (Q6108917) (← links)
- Almost disjoint paths and separating by forbidden pairs (Q6199396) (← links)
- \((k-2)\)-linear connected components in hypergraphs of rank \(k\) (Q6599814) (← links)