Pages that link to "Item:Q5402539"
From MaRDI portal
The following pages link to The subgraph homeomorphism problem (Q5402539):
Displaying 19 items.
- All normalized anti-monotonic overlap graph measures are bounded (Q408673) (← links)
- Manipulation can be hard in tractable voting systems even for constant-sized coalitions (Q465694) (← links)
- Methods for proving completeness via logical reductions (Q685391) (← links)
- Disjoint paths in symmetric digraphs (Q1003758) (← links)
- A minimization version of a directed subgraph homeomorphism problem (Q1014308) (← links)
- Triples in matroid circuits (Q1086243) (← links)
- The subgraph homeomorphism problem for small wheels (Q1117247) (← links)
- The directed subgraph homeomorphism problem (Q1132111) (← links)
- The subgraph homeomorphism problem (Q1137871) (← links)
- Disjoint paths in graphs (Q1150632) (← links)
- Symmetric space-bounded computation (Q1167537) (← links)
- Detecting cycles through three fixed vertices in a graph (Q1198018) (← links)
- Connectivity and edge-disjoint spanning trees (Q1837196) (← links)
- Disjoint paths in graphs. (Reprint) (Q2497998) (← links)
- Steiner trees, partial 2–trees, and minimum IFI networks (Q3311677) (← links)
- Shortest edge-disjoint paths in graphs (Q5096182) (← links)
- (Q5743515) (← links)
- Dichotomies for tree minor containment with structural parameters (Q6575410) (← links)
- Dichotomies for tree minor containment with structural parameters (Q6658295) (← links)