Pages that link to "Item:Q3984464"
From MaRDI portal
The following pages link to Covering the edges with consecutive sets (Q3984464):
Displaying 9 items.
- On the complexity of the k-chain subgraph cover problem (Q1275070) (← links)
- Sets defining minimal vertex covers (Q1292862) (← links)
- Proper interval graphs and the guard problem (Q1363667) (← links)
- Induced matchings in asteroidal triple-free graphs (Q1414582) (← links)
- Linear-time algorithms for maximum-weight induced matchings and minimum chain covers in convex bipartite graphs (Q2118390) (← links)
- Solving Matching Problems Efficiently in Bipartite Graphs (Q2946048) (← links)
- (Q4552242) (← links)
- Covering Arrays Avoiding Forbidden Edges (Q5505668) (← links)
- Connected proper interval graphs and the guard problem in spiral polygons (extended abstract) (Q6567668) (← links)