Pages that link to "Item:Q1275070"
From MaRDI portal
The following pages link to On the complexity of the k-chain subgraph cover problem (Q1275070):
Displaying 8 items.
- Linear-time algorithm for the paired-domination problem in convex bipartite graphs (Q692884) (← links)
- A constant factor approximation algorithm for boxicity of circular arc graphs (Q741528) (← links)
- The induced matching and chain subgraph cover problems for convex bipartite graphs (Q995582) (← links)
- Induced matchings in asteroidal triple-free graphs (Q1414582) (← links)
- A min-max property of chordal bipartite graphs with applications (Q1959718) (← links)
- Linear-time algorithms for maximum-weight induced matchings and minimum chain covers in convex bipartite graphs (Q2118390) (← links)
- On Maximal Chain Subgraphs and Covers of Bipartite Graphs (Q2819498) (← links)
- Computing connected-\(k\)-subgraph cover with connectivity requirement (Q6111948) (← links)
